zoukankan      html  css  js  c++  java
  • the philosophy behind of the design of the STL

    The concept of STL is based on a separation of data and operations. The data is managed by container classes, and the operations are defined by configurable algorithms. Iterators are the glue between these two components and they let any algorithm interact with any container.

     

    //violate using the iterator as the glue between the containers and the algorithm 
    template<T>
    Print(List<T> & container)
    {
        for(T item: container)
         {
            //...
         }
    }
     
    //correct
    template<T>
    Print(iterator<T> begin, iterator<T> end)
    {
        for(;begin < end && begin != end; begin ++)
        {
            //...
        }
    }
    1. The STL concept contradicts the original idea of object-oriented programming: the STL serarates data and algorithms rather than combining them. While you can combine every kinds of container with ever kind of algorithm, so the result is a very flexible but still rather small framework.
    2. The particular implementation of any container is not defined by the C++ standard library. However, the behavior and complexity secified by the standard do not leave much room for variation.
    3. The STL containers provide only those special member functions that in general have "good" performance, where "good" normal means constant or logarithmic complexity. e.g., a direct element access by using operator [] is not provided for lists. This is because lists don't provide random access, and so an operator [] would have bad performance. Which is also most like why there is no resize() for array. 
  • 相关阅读:
    c++ 学习笔记
    python 2048游戏控制器
    c++ 动态内存
    c++ 拷贝构造函数、拷贝运算符、析构函数
    c++ struct enum union加typedef与不加typedef
    c++ 动态内存2
    c++ 指针数组与指向数组的指针
    c++ TextQuery程序
    c++ virtual
    c++ 动态内存 动态数组
  • 原文地址:https://www.cnblogs.com/Cmpl/p/3747328.html
Copyright © 2011-2022 走看看