Find the first that's not in this set, starting from the end : string find « String « C++

1.	Bitset
2.	Class
3.	Console
4.	Data Structure
5.	Data Type
6.	Deque
7.	Development
8.	File
9.	Function
10.	Generic
11.	Language
12.	List
13.	Map Multimap
14.	Overload
15.	Pointer
16.	Qt
17.	Queue Stack
18.	Set Multiset
19.	STL Algorithms Binary search
20.	STL Algorithms Heap
21.	STL Algorithms Helper
22.	STL Algorithms Iterator
23.	STL Algorithms Merge
24.	STL Algorithms Min Max
25.	STL Algorithms Modifying sequence operations
26.	STL Algorithms Non modifying sequence operations
27.	STL Algorithms Sorting
28.	STL Basics
29.	String
30.	Valarray
31.	Vector

C / ANSI-C

C Tutorial

C++ Tutorial

Visual C++ .NET

C++ » String » string find

Screenshots

Find the first that's not in this set, starting from the end

  

 



#include <string>

#include <iostream>



int main( ) {

   std::string s = "Search from the beginning";



   std::cout << s.find_last_not_of("from")     // Find the first that's not in this set, starting from the end

             << '\n';

}



/* 

24



 */

Related examples in the same category

1.	search a sub string
2.	string.find(substring)
3.	string.rfind(substring)
4.	string.find_first_of( substring )
5.	string.find_last_of(substring)
6.	string.find_first_not_of( substring )
7.	Find the first of any of these chars starting from the end
8.	Search from the beginning
9.	Search from the end
10.	Find the first of any of these chars
11.	Find the first that's not in this set
12.	equivalent of strcspn() and strpbrk()
13.	equivalent of strspn()
14.	Using find with reverse iteration
15.	Use the STL find() algorithm to obtain an iterator to the start of the first 'a'

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.