iterator_example.cpp File Reference

STL-compatible iterator support for value_container. More...

#include "core/container.h"
#include <algorithm>
#include <iostream>
#include <numeric>

Include dependency graph for iterator_example.cpp:

Go to the source code of this file.

Functions
void	demonstrate_range_based_for ()
void	demonstrate_stl_algorithms ()
void	demonstrate_iterator_properties ()
int	main ()

Detailed Description

STL-compatible iterator support for value_container.

Definition in file iterator_example.cpp.

Function Documentation

demonstrate_iterator_properties()

void demonstrate_iterator_properties

(

)

Examples

iterator_example.cpp.

Definition at line 75 of file iterator_example.cpp.

{
    std::cout << "\n=== Iterator Properties ===" << std::endl;
 
    value_container container;
 
    std::cout << "Iterator methods available:" << std::endl;
    std::cout << "  container.begin()   - returns iterator to first element" << std::endl;
    std::cout << "  container.end()     - returns iterator to past-the-end" << std::endl;
    std::cout << "  container.cbegin()  - returns const_iterator to first element" << std::endl;
    std::cout << "  container.cend()    - returns const_iterator to past-the-end" << std::endl;
    std::cout << "  container.size()    - returns number of elements" << std::endl;
    std::cout << "  container.empty()   - returns true if empty" << std::endl;
 
    std::cout << "\nIterator types:" << std::endl;
    std::cout << "  using iterator = std::vector<optimized_value>::iterator;" << std::endl;
    std::cout << "  using const_iterator = std::vector<optimized_value>::const_iterator;" << std::endl;
}

Referenced by main().

Here is the caller graph for this function:

demonstrate_range_based_for()

void demonstrate_range_based_for

(

)

Examples

iterator_example.cpp.

Definition at line 29 of file iterator_example.cpp.

{
    std::cout << "\n=== Range-Based For Loop ===" << std::endl;
 
    value_container container;
 
    // Note: For demonstration, we're showing the concept
    // In actual use, you would populate the container with data
    std::cout << "Container size: " << container.size() << std::endl;
    std::cout << "Container empty: " << (container.empty() ? "yes" : "no") << std::endl;
 
    // Example of range-based for loop (when container has data)
    std::cout << "Range-based for loop syntax:" << std::endl;
    std::cout << "  for (const auto& value : container) {" << std::endl;
    std::cout << "      // Process each optimized_value" << std::endl;
    std::cout << "  }" << std::endl;
}

Referenced by main().

Here is the caller graph for this function:

demonstrate_stl_algorithms()

void demonstrate_stl_algorithms

(

)

Examples

iterator_example.cpp.

Definition at line 47 of file iterator_example.cpp.

{
    std::cout << "\n=== STL Algorithms ===" << std::endl;
 
    value_container container;
 
    // Example 1: find_if
    std::cout << "find_if example:" << std::endl;
    std::cout << "  auto it = std::find_if(container.begin(), container.end()," << std::endl;
    std::cout << "      [](const optimized_value& val) {" << std::endl;
    std::cout << "          return val.type == value_types::int_value;" << std::endl;
    std::cout << "      });" << std::endl;
 
    // Example 2: count_if
    std::cout << "\ncount_if example:" << std::endl;
    std::cout << "  size_t count = std::count_if(container.begin(), container.end()," << std::endl;
    std::cout << "      [](const optimized_value& val) {" << std::endl;
    std::cout << "          return val.type == value_types::string_value;" << std::endl;
    std::cout << "      });" << std::endl;
 
    // Example 3: for_each
    std::cout << "\nfor_each example:" << std::endl;
    std::cout << "  std::for_each(container.begin(), container.end()," << std::endl;
    std::cout << "      [](const optimized_value& val) {" << std::endl;
    std::cout << "          std::cout << val.name << std::endl;" << std::endl;
    std::cout << "      });" << std::endl;
}

Referenced by main().

Here is the caller graph for this function:

main()

int main

(

)

Definition at line 94 of file iterator_example.cpp.

{
    std::cout << "========================================" << std::endl;
    std::cout << "Container Iterator Support Examples" << std::endl;
    std::cout << "========================================" << std::endl;
 
    demonstrate_range_based_for();
    demonstrate_stl_algorithms();
    demonstrate_iterator_properties();
 
    std::cout << "\n========================================" << std::endl;
    std::cout << "Examples completed successfully!" << std::endl;
    std::cout << "========================================" << std::endl;
 
    return 0;
}

References demonstrate_iterator_properties(), demonstrate_range_based_for(), and demonstrate_stl_algorithms().

Here is the call graph for this function: