473,888 Members | 1,554 Online
Bytes | Software Development & Data Engineering Community
+ Post

Home Posts Topics Members FAQ

About the find() is STL algorithm

Hi All,

Just a thought, about the find() algorithm in the C++ STL. I read that
the find algorithm can take a range of iterators. If it does not find
the element it is looking for in that range it returns the iterator to
the last element in the range, not to the last element in the
container, to the last element in the range. That being said, how can
we tell if find() has been successful in finding the element we need?
Its easy when we are searching the whole container, we can always the
container's end() method, but when we are searching only a subset of
all the elements in a container, what then? Do we have a better way
than checking the element that find returns again?(sounds inefficient,
repetitive).

Would appreciate your thoughts on this matter.

Thanks, Draw

Jun 10 '06 #1
5 2585
* Draw:

Just a thought, about the find() algorithm in the C++ STL. I read that
the find algorithm can take a range of iterators. If it does not find
the element it is looking for in that range it returns the iterator to
the last element in the range, not to the last element in the
container, to the last element in the range.


A range of elements is specified as an iterator A to the first element,
and an iterator B one past the last element.

If std::find fails it returns B, in all cases.

Compare the result iterator to B.

--
A: Because it messes up the order in which people normally read text.
Q: Why is it such a bad thing?
A: Top-posting.
Q: What is the most annoying thing on usenet and in e-mail?
Jun 10 '06 #2
Alf P. Steinbach wrote:
* Draw:

Just a thought, about the find() algorithm in the C++ STL. I read that
the find algorithm can take a range of iterators. If it does not find
the element it is looking for in that range it returns the iterator to
the last element in the range, not to the last element in the
container, to the last element in the range.


A range of elements is specified as an iterator A to the first element,
and an iterator B one past the last element.

If std::find fails it returns B, in all cases.

Compare the result iterator to B.

--

Thanks, but I don't think I got an answer for my question. Are you
saying that I have to always give the start and end as the range? What
if I don't want to, what if I want to search only the first 10 elements
of the vector?
I went ahead and tried to do that, the code is right after I stop
blabbering :-), and find() does indeed return the last element of the
range if it doesn't find anything(not that of the container), but what
if the last element of the range does satisfy the condition find() is
looking for, in that case, it would still return the last element in
the range. Thats ambiguous, isn't it?
And what you say above proves it, it does return the last element in
the range you provide, but you are able to work around the situation I
mention because your last element happens to equal the iterator
*.end()(indeed, one past the last element).

//[START]

#include<iostre am>
#include<algori thm>
#include<vector >
int main(void){
unsigned int index;
vector<int> intvec(20,3);
vector<int>::it erator it,ret;
for(it = intvec.begin(), index=0;it != intvec.end();++ it,++index){
*it =+ index;
cout << "vector Element value equated to subscript "<<*it<<end l;
}
intvec[15] = 45;
cout << "Finding the element with value equal to 45 \n";
it = intvec.begin();
ret = find(it,it+10,4 5);
if(ret == intvec.end()){
cout << "No such value in the vector.\n";
}
else{
cout << "Element value " << *ret << endl;
}
return(0);
}

//[END]

Jun 11 '06 #3
Draw wrote:
Alf P. Steinbach wrote:
* Draw:

Just a thought, about the find() algorithm in the C++ STL. I read that
the find algorithm can take a range of iterators. If it does not find
the element it is looking for in that range it returns the iterator to
the last element in the range, not to the last element in the
container, to the last element in the range.


A range of elements is specified as an iterator A to the first element,
and an iterator B one past the last element.

If std::find fails it returns B, in all cases.

Compare the result iterator to B.

--

Thanks, but I don't think I got an answer for my question. Are you
saying that I have to always give the start and end as the range? What
if I don't want to, what if I want to search only the first 10 elements
of the vector?
I went ahead and tried to do that, the code is right after I stop
blabbering :-), and find() does indeed return the last element of the
range if it doesn't find anything(not that of the container), but what
if the last element of the range does satisfy the condition find() is
looking for, in that case, it would still return the last element in
the range. Thats ambiguous, isn't it?


The "one past the last element" concept is what you seem to be missing.

The range is specified by giving an iterator A to the first element and
an iterator B to _one past_ the last element in the range i.e. iterator
B itself does not point to an element within the range. Iterator B will
therefore never be returned if the element is found.

Jun 11 '06 #4
Markus Schoder wrote:
Draw wrote:
Alf P. Steinbach wrote:
* Draw:
>
> Just a thought, about the find() algorithm in the C++ STL. I read that
> the find algorithm can take a range of iterators. If it does not find
> the element it is looking for in that range it returns the iterator to
> the last element in the range, not to the last element in the
> container, to the last element in the range.

A range of elements is specified as an iterator A to the first element,
and an iterator B one past the last element.

If std::find fails it returns B, in all cases.

Compare the result iterator to B.

--

Thanks, but I don't think I got an answer for my question. Are you
saying that I have to always give the start and end as the range? What
if I don't want to, what if I want to search only the first 10 elements
of the vector?
I went ahead and tried to do that, the code is right after I stop
blabbering :-), and find() does indeed return the last element of the
range if it doesn't find anything(not that of the container), but what
if the last element of the range does satisfy the condition find() is
looking for, in that case, it would still return the last element in
the range. Thats ambiguous, isn't it?


The "one past the last element" concept is what you seem to be missing.

The range is specified by giving an iterator A to the first element and
an iterator B to _one past_ the last element in the range i.e. iterator
B itself does not point to an element within the range. Iterator B will
therefore never be returned if the element is found.


Thanks Guys! Now I see. Thanks for clarifying that.

Jun 11 '06 #5
Draw wrote:
Alf P. Steinbach wrote:
* Draw:
Just a thought, about the find() algorithm in the C++ STL. I read that
the find algorithm can take a range of iterators. If it does not find
the element it is looking for in that range it returns the iterator to
the last element in the range, not to the last element in the
container, to the last element in the range.
A range of elements is specified as an iterator A to the first element,
and an iterator B one past the last element.

If std::find fails it returns B, in all cases.

Compare the result iterator to B.

--


Thanks, but I don't think I got an answer for my question. Are you
saying that I have to always give the start and end as the range? What
if I don't want to, what if I want to search only the first 10 elements
of the vector?
I went ahead and tried to do that, the code is right after I stop
blabbering :-), and find() does indeed return the last element of the
range if it doesn't find anything(not that of the container), but what
if the last element of the range does satisfy the condition find() is
looking for, in that case, it would still return the last element in
the range. Thats ambiguous, isn't it?
And what you say above proves it, it does return the last element in
the range you provide, but you are able to work around the situation I
mention because your last element happens to equal the iterator
*.end()(indeed, one past the last element).

See the changed code.

//[START]

#include<iostre am>
#include<algori thm>
#include<vector >
int main(void){
unsigned int index;
vector<int> intvec(20,3);
vector<int>::it erator it,ret;
for(it = intvec.begin(), index=0;it != intvec.end();++ it,++index){
*it =+ index;
cout << "vector Element value equated to subscript "<<*it<<end l;
}
intvec[15] = 45;
cout << "Finding the element with value equal to 45 \n";
it = intvec.begin();
ret = find(it,it+10,4 5);

// if(ret == intvec.end()){
if (ret == (it+10)) {
// If find does not find the value in [it, it+10), it
// will return it+10, which is one element past the last
// element in [it, it+10) cout << "No such value in the vector.\n";
}
else{
cout << "Element value " << *ret << endl;
}
return(0);
}

//[END]

Jun 11 '06 #6

This thread has been closed and replies have been disabled. Please start a new discussion.

Similar topics

17
2147
by: Rich S. | last post by:
Hello Just like everyone else, I am excited about how easily one can create Windows applications with the .NET platform, but for shareware, I have some serious reservations 1. Your code can be easily decompiled. This would make it very difficult to implement any sort of license restrictions on your app, because anything you write can be easily viewed and cracked. This also removes any privacy for your intellectual property 2. Jim...
7
7081
by: Aguilar, James | last post by:
Hello all, To begin, yes, this -is- a homework assignment. However, it is for my Algorithms class, and my instructor has given us explicit permission to use "expert" groups like newsgroups, so if that's your only reason not to help, please do. Otherwise, I guess it's OK. But, just remember, I'm not asking you to do my work for me, just to point out my error. My problem is not with the algorithm itself (standard divide and conquer on...
4
6493
by: Code4u | last post by:
I need to write an algorithm that sheds the outliers in a large data set, for example, I might want to ignore the smallest 2% of values and find the next smallest. Boost has a nth_element algorithm, however, it partially sorts the data. I have a requirement that the data remain in the orginal order. Of course I could make a copy of the vector or array and then apply nth_element, but this would be expensive in memory and would require...
50
2882
by: Joseph Casey | last post by:
Greetings. I have read that the mistake of calling free(some_ptr) twice on malloc(some_data) can cause program malfunction. Why is this? With thanks. Joseph Casey.
5
1111
by: Crirus | last post by:
What do you think about this approaches, wich one is the best? For x As Integer = u.GetViewBounds.X To u.GetViewBounds.X + u.GetViewBounds.Width For y As Integer = u.GetViewBounds.Y To u.GetViewBounds.Y + u.GetViewBounds.Height Dim Dx As Integer = x - u.Location.X Dim Dy As Integer = y - u.Location.Y If Dx * Dx + Dy * Dy <= u.ViewRange * u.ViewRange Then 'punctul e in cercul vizual
2
1785
by: xeyder | last post by:
Hi everyone.. I need help about graph theory ( network problems) .. I have below problem . Does anyone know any existence algorithms or solutions to this problem ?? The Problems is: " We can use graphs to represent a communication network. In such graphs, the vertices represent communication stations and the edges represent communication
1
7435
by: Ghada Al-Mashaqbeh via DotNetMonster.com | last post by:
Hi all, I want to implement Lee Maze routing algorithm in C#, I have many problems especially in gaining usefull resources about the algorithm work, please if can any body help me to find usefull resources. Also, if anybody can send me the a link to the full artice of the following paper I will be very glad, the paper is: “An Algorithm for Path Connection And Its Application”, CY Lee, IRE
1
2614
by: hn.ft.pris | last post by:
"Forward maximum match" mean that there is a dictionary contains thousands of items which are single words. For example, "kid", "nice", "best"... And here get a string "kidnicebs", the forward maximum match algorithm need to find the longest string that matches the string in dictionary. Because the longest string in the dictionary has a length of 4, so the algoritm pick the first four characters of the string(that's why it's called...
30
2762
by: gaoxtwarrior | last post by:
a sort which is stable means it keeps the object's original order. A sort which is in place is stable. does anyone can explain me what is sort in place? thx.
0
9800
by: Hystou | last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can effortlessly switch the default language on Windows 10 without reinstalling. I'll walk you through it. First, let's disable language synchronization. With a Microsoft account, language settings sync across devices. To prevent any complications,...
0
11182
Oralloy
by: Oralloy | last post by:
Hello folks, I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>". The problem is that using the GNU compilers, it seems that the internal comparison operator "<=>" tries to promote arguments from unsigned to signed. This is as boiled down as I can make it. Here is my compilation command: g++-12 -std=c++20 -Wnarrowing bit_field.cpp Here is the code in...
0
10778
jinu1996
by: jinu1996 | last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven tapestry of website design and digital marketing. It's not merely about having a website; it's about crafting an immersive digital experience that captivates audiences and drives business growth. The Art of Business Website Design Your website is...
1
10886
by: Hystou | last post by:
Overview: Windows 11 and 10 have less user interface control over operating system update behaviour than previous versions of Windows. In Windows 11 and 10, there is no way to turn off the Windows Update option using the Control Panel or Settings app; it automatically checks for updates and installs any it finds, whether you like it or not. For most users, this new feature is actually very convenient. If you want to control the update process,...
0
9597
agi2029
by: agi2029 | last post by:
Let's talk about the concept of autonomous AI software engineers and no-code agents. These AIs are designed to manage the entire lifecycle of a software development projectplanning, coding, testing, and deploymentwithout human intervention. Imagine an AI that can take a project description, break it down, write the code, debug it, and then launch it, all on its own.... Now, this would greatly impact the work of software developers. The idea...
1
7990
isladogs
by: isladogs | last post by:
The next Access Europe User Group meeting will be on Wednesday 1 May 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM). In this session, we are pleased to welcome a new presenter, Adolph Dupr who will be discussing some powerful techniques for using class modules. He will explain when you may want to use classes instead of User Defined Types (UDT). For example, to manage the data in unbound forms. Adolph will...
0
7148
by: conductexam | last post by:
I have .net C# application in which I am extracting data from word file and save it in database particularly. To store word all data as it is I am converting the whole word file firstly in HTML and then checking html paragraph one by one. At the time of converting from word file to html my equations which are in the word document file was convert into image. Globals.ThisAddIn.Application.ActiveDocument.Select();...
1
4642
by: 6302768590 | last post by:
Hai team i want code for transfer the data from one system to another through IP address by using C# our system has to for every 5mins then we have to update the data what the data is updated we have to send another system
2
4245
muto222
by: muto222 | last post by:
How can i add a mobile payment intergratation into php mysql website.

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.