# Get the distance between two element in a list : distance « STL Algorithms Helper « C++

Home
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++ » STL Algorithms Helper » distance Screenshots
Get the distance between two element in a list
 ```    /* The following code example is taken from the book  * "The C++ Standard Library - A Tutorial and Reference"  * by Nicolai M. Josuttis, Addison-Wesley, 1999  *  * (C) Copyright Nicolai M. Josuttis 1999.  * Permission to copy, use, modify, sell and distribute this software  * is granted provided this copyright notice appears in all copies.  * This software is provided "as is" without express or implied  * warranty, and with no claim as to its suitability for any purpose.  */ #include  #include  #include  using namespace std; int main() {     list coll;     // insert elements from -3 to 9     for (int i=-3; i<=9; ++i) {         coll.push_back(i);     }     // search element with value 5     list::iterator pos;     pos = find (coll.begin(), coll.end(),    // range                 5);                          // value     if (pos != coll.end()) {         // process and print difference from the beginning         cout << "difference between beginning and 5: "              << distance(coll.begin(),pos) << endl;     }     else {         cout << "5 not found" << endl;     } } /*  difference between beginning and 5: 8  */           ```
Related examples in the same category
 1 distance for vector