Team Fortress 2 Source Code as on 22/4/2020
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

129 lines
3.4 KiB

  1. /**
  2. * @file std_queue.i
  3. * @date Sun May 6 01:48:07 2007
  4. *
  5. * @brief A wrapping of std::queue for Ruby.
  6. *
  7. *
  8. */
  9. %include <std_container.i>
  10. // Queue
  11. %define %std_queue_methods(queue...)
  12. queue();
  13. queue( const _Sequence& );
  14. bool empty() const;
  15. size_type size() const;
  16. const value_type& front() const;
  17. const value_type& back() const;
  18. void pop();
  19. void push( const value_type& );
  20. %enddef
  21. %define %std_queue_methods_val(queue...)
  22. %std_queue_methods(queue)
  23. %enddef
  24. // ------------------------------------------------------------------------
  25. // std::queue
  26. //
  27. // const declarations are used to guess the intent of the function being
  28. // exported; therefore, the following rationale is applied:
  29. //
  30. // -- f(std::queue<T>), f(const std::queue<T>&):
  31. // the parameter being read-only, either a sequence or a
  32. // previously wrapped std::queue<T> can be passed.
  33. // -- f(std::queue<T>&), f(std::queue<T>*):
  34. // the parameter may be modified; therefore, only a wrapped std::queue
  35. // can be passed.
  36. // -- std::queue<T> f(), const std::queue<T>& f():
  37. // the queue is returned by copy; therefore, a sequence of T:s
  38. // is returned which is most easily used in other functions
  39. // -- std::queue<T>& f(), std::queue<T>* f():
  40. // the queue is returned by reference; therefore, a wrapped std::queue
  41. // is returned
  42. // -- const std::queue<T>* f(), f(const std::queue<T>*):
  43. // for consistency, they expect and return a plain queue pointer.
  44. // ------------------------------------------------------------------------
  45. %{
  46. #include <queue>
  47. %}
  48. // exported classes
  49. namespace std {
  50. template<class _Tp, class _Sequence = std::deque<_Tp> >
  51. class queue {
  52. public:
  53. typedef size_t size_type;
  54. typedef _Tp value_type;
  55. typedef value_type& reference;
  56. typedef const value_type& const_reference;
  57. typedef _Sequence container_type;
  58. %traits_swigtype(_Tp);
  59. %fragment(SWIG_Traits_frag(std::queue<_Tp, _Sequence >), "header",
  60. fragment=SWIG_Traits_frag(_Tp),
  61. fragment="StdQueueTraits") {
  62. namespace swig {
  63. template <> struct traits<std::queue<_Tp, _Sequence > > {
  64. typedef pointer_category category;
  65. static const char* type_name() {
  66. return "std::queue<" #_Tp "," #_Sequence " >";
  67. }
  68. };
  69. }
  70. }
  71. %typemap_traits_ptr(SWIG_TYPECHECK_QUEUE, std::queue<_Tp, _Sequence >);
  72. #ifdef %swig_queue_methods
  73. // Add swig/language extra methods
  74. %swig_queue_methods(std::queue<_Tp, _Sequence >);
  75. #endif
  76. %std_queue_methods(queue);
  77. };
  78. template<class _Tp, class _Sequence >
  79. class queue<_Tp*, _Sequence > {
  80. public:
  81. typedef size_t size_type;
  82. typedef _Tp value_type;
  83. typedef value_type& reference;
  84. typedef const value_type& const_reference;
  85. typedef _Sequence container_type;
  86. %traits_swigtype(_Tp);
  87. %fragment(SWIG_Traits_frag(std::queue<_Tp*, _Sequence >), "header",
  88. fragment=SWIG_Traits_frag(_Tp),
  89. fragment="StdQueueTraits") {
  90. namespace swig {
  91. template <> struct traits<std::queue<_Tp*, _Sequence > > {
  92. typedef value_category category;
  93. static const char* type_name() {
  94. return "std::queue<" #_Tp "," #_Sequence " * >";
  95. }
  96. };
  97. }
  98. }
  99. %typemap_traits_ptr(SWIG_TYPECHECK_QUEUE, std::queue<_Tp*, _Sequence >);
  100. #ifdef %swig_queue_methods_val
  101. // Add swig/language extra methods
  102. %swig_queue_methods_val(std::queue<_Tp*, _Sequence >);
  103. #endif
  104. %std_queue_methods_val(std::queue<_Tp*, _Sequence >);
  105. };
  106. }