#include <proton/string.hpp>
using namespace std;
using namespace proton;
int main()
{
cout << ">>> deque_ examples :" << endl;
cout << "last item is :" << s[-1] << endl;
slice=s(1,-1);
slice=s(0,3,2);
slice=slice*2;
slice=2*slice;
slice=slice+s;
s.append("b");
cout << "There is " << s.count("b") << " of b in s." << endl;
s.extend(t);
int i=s.index("c");
s.insert(-1,"x");
string k=s.pop();
k=s.pop();
size_t n=s.count("b");
s.remove("b");
string r=s[-2];
s.reverse();
cout << "reversed deque is :" << s << endl;
s.sort();
cout << "sorted deque is :" << s << endl;
cout <<
"min is :" <<
min(s) << endl;
cout <<
"max is :" <<
max(s) << endl;
s.del(-1);
s.del(1,-1);
s.del_to_end(1);
return 0;
}