CPSC 421 OOP Iterator

12345678910111213141516171819202122232425262728293031323334353637383940414243
Across
  1. 3. A C++11 function equivalent to "p + n"
  2. 4. Name of the operator for "p[n]"
  3. 7. The iterator that cannot do decrement
  4. 12. Container method that returns an iterator to the first element
  5. 13. Early programming language with forward iterators only and where indexing made no sense
  6. 15. Use this as the type to make declaration easier and to make the code more adaptable
  7. 16. The iterator that can do decrement, but not increment with n > 1
  8. 17. Name of the operator for "*p"
  9. 18. Const iterator form of end()
  10. 20. A C++ function equivalent to "p += n"
  11. 22. _____ usage helps in the comprehension of the code
  12. 23. Always prefer __-___ to post-increment
  13. 26. Are we done yet?
  14. 30. A C++11 function that is the number of elements from begin to p, i.e., "p - begin"
  15. 32. An iterator that models access to singly-linked lists
  16. 33. Always prefer __-____ to post-decrement
  17. 34. An iterator with one-pass output to streams
  18. 35. A common interface makes it ____ to learn new data structures
  19. 36. A C++11 function equivalent to "p - n"
  20. 39. Const iterator form of begin()
  21. 40. One of the C++ Library Sequence Containers
  22. 42. Const reverse iterator form of begin()
  23. 43. Name of the operator for "++p"
Down
  1. 1. An iterator that models access to doubly-linked lists
  2. 2. Can create ____-______ data structures that work with existing algorithms
  3. 3. std::vector, std::deque, and std::list are examples of ______ containers
  4. 5. Const reverse iterator form of end()
  5. 6. Iterators began with data structures where _____ is expensive, but accessing the next element is not
  6. 8. Reverse iterator form of begin()
  7. 9. We use "!=" instead of "<" with iterators because sequential elements may not be _______
  8. 10. std::set and std::map are examples of _____ containers
  9. 11. Iterator Design ____
  10. 14. Iterators are small and passed by ____
  11. 19. Restart the iteration in the GoF Iterator
  12. 21. Get current item in the GoF Iterator
  13. 24. Reverse iterator form of end()
  14. 25. Nickname for the authors of "Design Patterns: Elements of Reusable Object-Oriented Software"
  15. 27. One of the C++ Library Algorithms
  16. 28. The ____-_____ iterator models array access
  17. 29. Advance to the next item in the GoF Iterator
  18. 31. An iterator with one-pass input from streams
  19. 37. One of the C++ Library Sequence Containers
  20. 38. One of the C++ Library Sequence Containers
  21. 40. One of the C++ Library Algorithms
  22. 41. Container method that returns an iterator past the last element of the container