| 540 | |
| 541 | template <typename T> |
| 542 | class sstack |
| 543 | { |
| 544 | public: |
| 545 | typedef T value_type; |
| 546 | |
| 547 | sstack() = delete; |
| 548 | |
| 549 | sstack ( |
| 550 | T* data_, |
| 551 | size_t s |
| 552 | ) : data(data_), mysize(s) {} |
| 553 | |
| 554 | const T& top() const |
| 555 | { |
| 556 | DLIB_CASSERT(size() != 0, "You can't call top() on an empty stack"); |
| 557 | return *data; |
| 558 | } |
| 559 | T& top() |
| 560 | { |
| 561 | DLIB_CASSERT(size() != 0, "You can't call top() on an empty stack"); |
| 562 | return *data; |
| 563 | } |
| 564 | |
| 565 | size_t size() const { return mysize; } |
| 566 | |
| 567 | sstack pop(size_t num=1) |
| 568 | { |
| 569 | DLIB_CASSERT(num <= size(), "You can't pop more things from the stack than it has in it."); |
| 570 | return sstack(data+num, mysize-num); |
| 571 | } |
| 572 | |
| 573 | private: |
| 574 | |
| 575 | T* data; |
| 576 | size_t mysize; |
| 577 | }; |
| 578 | |
| 579 | template <typename T> |
| 580 | sstack<T> make_sstack(std::vector<T>& item) |