compile c++ gcc online

Language: Layout:

//Title of this code
//g++  4.9.2

#include <iostream>
#include <list>
#include <iterator>
#include <algorithm>

struct Test
{
    Test(int x) : x_(x){std::cout << "ctor. x = " << x_ << std::endl ; }
    Test(const Test& src) : x_(src.x_){std::cout << "cctor. x = " << x_ << std::endl ; }
    Test(Test&& src) : x_(src.x_){std::cout << "mctor. x = " << x_ << std::endl ; }
    const Test& operator=(const Test& rhv) { x_=rhv.x_ ; std::cout << "oper=. x = " << x_ << std::endl ; return *this; }
    ~Test(){std::cout << "dtor. x = " << x_ << std::endl ; }
    bool operator<(const Test& rhv) {return x_<rhv.x_ ;}
    int x_ ;
} ;

std::ostream& operator<<(std::ostream& stream, const Test& obj)
{
    stream << obj.x_ << ' ' ;
    return stream ;
}

int main()
{
    std::list<Test> lst {3, 7, 8, 9, 3, 1, 7, 8, 2, 4, 6, 5, 8} ;
    auto iter_beg = lst.begin() ;
    auto iter_end = lst.end() ;
    std::advance(iter_beg, 2) ;
    std::advance(iter_end, -1) ;
    
    std::cout << "start algorithm" << std::endl ;
    
    std::vector<Test> tmp_vec(iter_beg, iter_end) ;
    std::sort(tmp_vec.begin(), tmp_vec.end()) ;
    std::move(tmp_vec.begin(), tmp_vec.end(), iter_beg) ;
    
    std::cout << "end algorithm" << std::endl ; 
    for(const auto & e: lst)
        std::cout << e << ' ' ;
    std::cout << std::endl ;
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 1.42 sec, absolute running time: 0.14 sec, cpu time: 0 sec, memory peak: 4 Mb, absolute service time: 1.58 sec

ctor. x = 3 ctor. x = 7 ctor. x = 8 ctor. x = 9 ctor. x = 3 ctor. x = 1 ctor. x = 7 ctor. x = 8 ctor. x = 2 ctor. x = 4 ctor. x = 6 ctor. x = 5 ctor. x = 8 cctor. x = 3 cctor. x = 7 cctor. x = 8 cctor. x = 9 cctor. x = 3 cctor. x = 1 cctor. x = 7 cctor. x = 8 cctor. x = 2 cctor. x = 4 cctor. x = 6 cctor. x = 5 cctor. x = 8 dtor. x = 8 dtor. x = 5 dtor. x = 6 dtor. x = 4 dtor. x = 2 dtor. x = 8 dtor. x = 7 dtor. x = 1 dtor. x = 3 dtor. x = 9 dtor. x = 8 dtor. x = 7 dtor. x = 3 start algorithm cctor. x = 8 cctor. x = 9 cctor. x = 3 cctor. x = 1 cctor. x = 7 cctor. x = 8 cctor. x = 2 cctor. x = 4 cctor. x = 6 cctor. x = 5 mctor. x = 9 oper=. x = 9 dtor. x = 9 mctor. x = 3 oper=. x = 9 oper=. x = 8 oper=. x = 3 dtor. x = 3 mctor. x = 1 oper=. x = 9 oper=. x = 8 oper=. x = 3 oper=. x = 1 dtor. x = 1 mctor. x = 7 oper=. x = 9 oper=. x = 8 oper=. x = 7 dtor. x = 7 mctor. x = 8 oper=. x = 9 oper=. x = 8 dtor. x = 8 mctor. x = 2 oper=. x = 9 oper=. x = 8 oper=. x = 8 oper=. x = 7 oper=. x = 3 oper=. x = 2 dtor. x = 2 mctor. x = 4 oper=. x = 9 oper=. x = 8 oper=. x = 8 oper=. x = 7 oper=. x = 4 dtor. x = 4 mctor. x = 6 oper=. x = 9 oper=. x = 8 oper=. x = 8 oper=. x = 7 oper=. x = 6 dtor. x = 6 mctor. x = 5 oper=. x = 9 oper=. x = 8 oper=. x = 8 oper=. x = 7 oper=. x = 6 oper=. x = 5 dtor. x = 5 oper=. x = 1 oper=. x = 2 oper=. x = 3 oper=. x = 4 oper=. x = 5 oper=. x = 6 oper=. x = 7 oper=. x = 8 oper=. x = 8 oper=. x = 9 end algorithm 3 7 1 2 3 4 5 6 7 8 8 9 8 dtor. x = 1 dtor. x = 2 dtor. x = 3 dtor. x = 4 dtor. x = 5 dtor. x = 6 dtor. x = 7 dtor. x = 8 dtor. x = 8 dtor. x = 9 dtor. x = 3 dtor. x = 7 dtor. x = 1 dtor. x = 2 dtor. x = 3 dtor. x = 4 dtor. x = 5 dtor. x = 6 dtor. x = 7 dtor. x = 8 dtor. x = 8 dtor. x = 9 dtor. x = 8