Guest User

Untitled

a guest
Dec 15th, 2017
94
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.52 KB | None | 0 0
  1. #include "keyed_queue.h"
  2. #include <cassert>
  3. #include <iostream>
  4.  
  5.  
  6. int main () {
  7. int keys[] = {1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3};
  8. int vals[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
  9. int expected[] = {1, 3, 4, 6, 7, 9, 10, 12, 2, 5, 8, 11};
  10.  
  11. keyed_queue<int, int> kq;
  12. for (int i = 0; i < 12; ++i) {
  13. kq.push(keys[i], vals[i]);
  14. }
  15.  
  16. kq.move_to_back(2);
  17. for (int i = 0; i < 12; ++i) {
  18. std::cout << kq.front().second << "\n";
  19. // assert(expected[i] == kq.front().second);
  20. kq.pop();
  21. }
  22.  
  23. return 0;
  24.  
  25. }
Add Comment
Please, Sign In to add comment