std.stcgafpmufdcppp.cpp.tags 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250
  1. #format=pipe
  2. # @brief Geany tags for the C++ "Standard Library"
  3. #
  4. # Geany Tags file for whatever people call the C++ "Standard Template Library".
  5. # Some people argue whether to call it "STL", "stdlib", "standard STL", etc.
  6. # As part of a contest for the longest STL acronym in Freenode's #C++ channel,
  7. # I eventually coined this completely unambiguous acronym for it:
  8. # STC-GA-FP-MU-FDCPPP : Standard Templated Containers, Generic Algorithms,
  9. # Functional Programming and Miscellaneous Utilities Framework
  10. # for the Development of C++ Programs.
  11. #
  12. # @author Luis Machuca Bezzaza <lambalicious@tuta.io>
  13. # @version 4
  14. # Nontrivial Container Constructors
  15. vector||<T>(Iterator begin, Iterator end)|
  16. vector||<T>(Integral count, T t0)|
  17. deque||<T>(Iterator begin, Iterator end)|
  18. deque||<T>(Integral count, T t0)|
  19. list||<T>(Iterator begin, Iterator end)|
  20. list||<T>(Integral count, T t0)|
  21. valarray||<T>(T const* pointer, size_type length)|
  22. forward_list||<T>(Iterator begin, Iterator end)|
  23. forward_list||<T>(Integral count, T t0)|
  24. # <algorithm>
  25. # ...to operate on values
  26. min|T|(T v1, T v2)|
  27. max|T|(T v1, T v2)|
  28. clamp|T|(T& val, T low, T high, Less lt)|
  29. clamp|T|(T& val, T low, T high)|
  30. # ...to query a sequence
  31. all_of|bool|(Iterator begin, Iterator end, Predicate if)|
  32. any_of|bool|(Iterator begin, Iterator end, Predicate if)|
  33. none_of|bool|(Iterator begin, Iterator end, Predicate if)|
  34. count|Integral|(Iterator begin, Iterator end, T value)|Counts ocurrences of 'value'
  35. count_if|Integral|(Iterator begin, Iterator end, Predicate if)|Counts ocurrences of predicate 'f(value)' being true
  36. find|Iterator|(Iterator begin, Iterator end, T value)|Finds an ocurrence of 'value'
  37. find_if|Iterator|(Iterator begin, Iterator end, Predicate if)|Finds an ocurrence of predicate 'f(value)' being true
  38. find_if_not|Iterator|(Iterator begin, Iterator end, Predicate if)|Finds an ocurrence of predicate 'f(value)' being false
  39. find_first_of|FwI1|(FwI1 begin1, FwI1 end1, FwI2 begin2, FwI2 end2)|
  40. find_first_of|FwI1|(FwI1 begin1, FwI1 end1, FwI2 begin2, FwI2 end2, Equality eq)|
  41. adjacent_find|FwI|(FwI begin, FwI end, Equality eq )|
  42. min_element|Iterator|(Iterator begin, Iterator end, Less lt)|
  43. min_element|Iterator|(Iterator begin, Iterator end)|
  44. max_element|Iterator|(Iterator begin, Iterator end, Less lt)|
  45. max_element|Iterator|(Iterator begin, Iterator end)|
  46. minmax_element|pair<FwI,FwI>|(Iterator begin, Iterator end, Less lt)|
  47. minmax_element|pair<FwI,FwI>|(Iterator begin, Iterator end)|
  48. is_sorted|bool|(FwI begin, FwI end, Less lt)|
  49. is_sorted_until|FwI marker|(FwI begin, FwI end, Less lt)|
  50. includes|bool|(Iterator1 begin, Iterator1 end, Iterator2 subset_begin, Iterator2 subset_end, Predicate less(x,y)->bool)|
  51. lower_bound|FwI marker_notless|(FwI begin, FwI end, T value, Less lt)|
  52. upper_bound|FwI marker_greater|(FwI begin, FwI end, T value, Less lt)|
  53. binary_search|bool|(Iterator begin, Iterator end, T value, Less lt)|Finds 'value' in a sorted sequence
  54. # ...to compare sequences
  55. equal|bool|(Iterator1 begin1, Iterator1 end1, Iterator2 begin2)|
  56. equal|bool|(Iterator1 begin1, Iterator1 end1, Iterator2 begin2, Compare f(a,b))|Returns true if both sequences are identical
  57. equal|bool|(Iterator1 begin, Iterator1 end1, Iterator2 begin2, Iterator2 end2)|
  58. equal|bool|(Iterator1 begin, Iterator1 end1, Iterator2 begin2, Iterator2 end2, Compare f(a,b))|
  59. mismatch|pair<Iterator1,Iterator2>|(Iterator1 begin1, Iterator1 end1, Iterator2 begin2)|Finds the positions where two sequences differ.
  60. mismatch|pair<Iterator1,Iterator2>|(Iterator1 begin1, Iterator1 end1, Iterator2 begin2, Compare = std::equal_to<T>)|Finds the positions where two sequences differ.
  61. mismatch|pair<Iterator1,Iterator2>|(Iterator1 begin1, Iterator1 end1, Iterator2 begin2, Iterator2 end2)|Finds the positions where two sequences differ.
  62. mismatch|pair<Iterator1,Iterator2>|(Iterator1 begin1, Iterator1 end1, Iterator2 begin2, Iterator2 end2, Compare = std::equal_to<T>)|Finds the positions where two sequences differ.
  63. lexicographical_compare|bool less|(FwI1 begin1, FwI1 end1, FwI2 begin2, FwI2 end2, Less lt)|
  64. lexicographical_compare|bool less|(FwI1 begin1, FwI1 end1, FwI2 begin2, FwI2 end2)|
  65. lexicographical_compare_three_way|std::strong_ordering::...|(FwI1 begin1, FwI1 end1, FwI2 begin2, FwI2 end2, Comp3way comp)|
  66. lexicographical_compare_three_way|std::strong_ordering::...|(FwI1 begin1, FwI1 end1, FwI2 begin2, FwI2 end2)|
  67. # ...to copy from a sequence
  68. copy|DestIt|(SrcIt begin, SrcIt end, DestIt target)|
  69. copy_if|DestIt|(SrcIt begin, SrcIt end, DestIt target, Predicate if)|
  70. copy_n|OutputIterator|(Iterator begin, Integral n, OutputIterator target)|
  71. copy_backward|OutputIterator|(Iterator begin, Iterator end, OutputIterator target_end)|
  72. move|OutputIterator|(Iterator begin, Iterator end, OutputIterator target)|Move elements in a sequence
  73. move_backward|OutputBidiIterator|(BidiIterator begin, BidiIterator end, OutputBidiIterator target_end)|
  74. partition_copy|pair<OIter1,OIter2>|(Iterator begin, Iterator end, OIter1 true_dest, OIter2 false_dest, Predicate f(x)->bool)|
  75. # ...to modify a sequence
  76. fill|void|(OutputIterator begin, OutputIterator end, value)|Fills sequence with 'value'
  77. fill_n|void|(OutputIterator begin, Integral n, value)|Fills 'n' positions with 'value'
  78. generate|void|(OutputIterator begin, OutputIterator end, Generator g()->T)|Fills sequence with value calls to 'g()'
  79. generate_n|void|(OutputIterator begin, Integral n, Generator g()->T)|Fills 'n' positions with value calls to 'g()'
  80. remove|FwIt|(FwIt begin, FwIt end, T const& value)|"Removes" 'value' elements and returns new end marker for .erase
  81. remove_copy|Output|(Input begin, Input end, Output target, T const& value)|
  82. remove_if|FwIt|(FwIt begin, FwIt end, Predicate p)|"Removes" 'value' elements and returns new end marker for .erase
  83. remove_copy_if|Output|(Input begin, Input end, Output target, Predicate p)|
  84. replace|void|(FwI begin, FwI end, T old, T new)|
  85. replace_if|void|(FwI begin, FwI end, Predicate f(T), T new)|
  86. replace_copy|Output|(Input begin, Input end, Output dest_begin, T old, T new)|
  87. replace_copy_if|Output|(Input begin, Input end, Output dest_begin, Predicate f(T), T new)|
  88. unique|Iterator new_end|(Iterator begin, Iterator end, Compare = std::equal<T>)|
  89. unique_copy|Output new_end|(Input begin, Input end, Output target, Compare = std::equal<T>)|
  90. for_each|Unary|(InputIt begin, InputIt end, Unary f )|
  91. for_each_n|Unary|(InputIt begin, Numeric n, Unary f)|
  92. transform|OIterator|(SrcIterator begin, SrcIterator end, OIterator output, Transformation f(x)->y)|
  93. transform|OIterator|(SrcIterator xbegin, SrcIterator xend, YIterator ybegin, OIterator output, Callable f(x,y)->OIterator::value_type)|
  94. # ...to reorder
  95. reverse|void|(Iterator begin, Iterator end)|
  96. reverse_copy|Output|(Input begin, Input end, Output target)|
  97. rotate|FwIt c++11|(FwIt begin, FwIt new_begin, FwIt last)|
  98. rotate|void c++03|(FwIt begin, FwIt new_begin, FwIt last)|
  99. rotate_copy|Output|(Input begin, Input new_begin, Input last, Output target)|
  100. shift_left|Iterator new_end|(Iterator begin, Iterator end, difference_type n)|
  101. shift_right|Iterator new_begin|(Iterator begin, Iterator end, difference_type n)|
  102. sort|void|(Iterator begin, Iterator end, Predicate less(x,y)->bool)|
  103. partial_sort|void|(RIt begin, RIt middle, RIt end, Less lt)|
  104. stable_sort|void|(RIt begin, RIt pivot, RIt end, Less lt)|
  105. partition|BidiIt|(BidiIt begin, BidiIt end, Predicate select)|
  106. stable_partition|BidiIt|(BidiIt begin, BidiIt end, Predicate select)|
  107. partition_point|FwI|(FwI begin, FwI end, Predicate select)|
  108. next_permutation|bool|(BidiIt begin, BidiIt end, Less lt)|
  109. prev_permutation|bool|(BidiIt begin, BidiIt end, Less lt)|
  110. is_permutation|bool|(FwI1 begin1, FwI1 end1, FwI2 begin2, Equality eq)|
  111. is_permutation|bool|(FwI1 begin1, FwI1 end1, FwI2 begin2, FwI2 end2, Equality eq)|
  112. #random_shuffle (PENDING)
  113. # ...to find or compare a subsequence
  114. search|FwI|(FwI begin, FwI end, SubseqIter seq_begin, SubseqIter seq_end)|Searches instance of a subsequence
  115. search|FwI|(FwI begin, FwI end, SubseqIter seq_begin, SubseqIter seq_end, Equality eq)|Searches instance of a subsequence
  116. search_n|FwI|(FwI begin, FwI end, Integer count_n, T const& value)|
  117. search_n|FwI|(FwI begin, FwI end, Integer count_n, Equality eq)|
  118. find_end|FwI|(FwI begin, FwI end, SrcIter seq_begin, SrcIter seq_end)|Finds last ocurrence of subsequence
  119. find_end|FwI|(FwI begin, FwI end, SrcIter seq_begin, SrcIter seq_end, Equality eq)|Finds last ocurrence of subsequence
  120. # ...to trade sequences
  121. iter_swap|void|(Iterator a, Iterator b )|
  122. swap_ranges|FwI2|(FwI1 begin1, FwI1 end1, FwI2 begin2)|
  123. # ...to create sets (PENDING)
  124. # ...to create heaps (PENDING)
  125. #
  126. # <functional>
  127. ref|reference_wrapper<T>|(T &object)|Wraps a reference to an object
  128. cref|reference_wrapper<T const>|(T const &object)|Wraps a reference to an object
  129. bind1st|binder1st<F>|(functionlike&, arg1)|deprecated
  130. bind2nd|binder2nd<F>|(functionlike&, arg2)|deprecated
  131. ptr_fun|pointer_to_unary_function<Arg,R>|(R(*function)(Arg))|c++03
  132. ptr_fun|pointer_to_binary_function<Arg1,Arg2,R>|(R(*function)(Arg1,Arg2))|c++03
  133. mem_fn|[function object]|(functiontype Class::* funtion_pointer)|Wraps a member function as a function-like object
  134. mem_fn|[function object]|(membertype Class::* member_pointer)|Wraps access to a member variable as a function-like object
  135. mem_fun_t|[function object]|(Class::*function_member)|deprecated
  136. bind|[function object]|(functionlike&&, arguments...)|c++03
  137. bind|[function object]|<R,F>(functionlike&&, arguments...)|c++03
  138. bind_front|[function object]|(functionlike&&, arguments...)|c++20
  139. function|function<fn_prototype>|(function pointer or functoid)|Wraps a function as a function-like object
  140. is_placeholder|bool|(argument or _placeholder)|
  141. not_fn|[function_object]|(functionlike&&)|c++17
  142. invoke|deduced type|(Functor, args...)|c++17
  143. #
  144. # <iterator>
  145. advance|void|(Iterator& p, difference_type n)|Advances an iterator
  146. distance|difference_type|(Iterator p1, Iterator p2)|Calculates distance between two iterators
  147. begin|iterator type|(Range r[begin,end) )|Begin of a sequence
  148. end|iterator type|(Range r[begin,end] )|End of a sequence
  149. cbegin|const_iterator type|(Range r[begin,end) )|
  150. cend|const_iterator type|(Range r[begin,end) )|
  151. next|Iterator|(Iterator p, difference_type n)|Moves forwards from an iterator
  152. prev|Iterator|(Iterator p, difference_type n)|Moves backwards from an iterator
  153. size|size_t|(Containerlike)|
  154. data|pointer|(Containerlike)|
  155. empty|bool|(Containerlike)|
  156. ssize|signed integer|(Containerlike)|
  157. back_inserter|back_insert_iterator<Container>|(Container& c)|
  158. front_inserter|front_insert_iterator<Container>|(Container& c)|
  159. make_reverse_iterator|reverse_iterator<Iter>|(Iter i)|
  160. make_move_iterator|move_iterator<Iter>|(Iter i)|
  161. #
  162. # <memory>
  163. addressof|T*|(T &object)|Finds the address in memory of an object
  164. align|void*|(size_t alignment, size_t size, void*& ptr, size_t& space)|
  165. # ...raw memory management
  166. uninitialized_default_construct|void|(MemoryIter begin, MemoryIter end)|
  167. uninitialized_default_construct_n|MemoryIter end|(MemoryIter begin, Integral n)|
  168. uninitialized_copy|MemoryIter|(InputIter begin, InputIter end, MemoryIter begin_uninitialized )|
  169. uninitialized_copy_n|MemoryIter|(InputIter begin, Integral n, MemoryIter begin_uninitialized )|
  170. uninitialized_fill|void|(MemoryIter begin, MemoryIter end, T const& value )|
  171. uninitialized_fill_n|void|(MemoryIter begin, Integral n, T const& value )|
  172. uninitialized_move|MemoryOutput|(MemoryInput begin, MemoryInput end, MemoryOutput dest)|
  173. get_temporary_buffer|pair< T*, ptrdiff_t >|( std::ptrdiff_t count )|
  174. return_temporary_buffer|void|(T*)|
  175. destroy|void|(MemoryIter begin, MemoryIter end)|
  176. destroy_n|MemoryIter|(MemoryIter begin, Integral n)|
  177. destroy_at|void|( T* p )|Destroys as if by a destructor call
  178. # ...smart pointers
  179. make_shared|shared_ptr<Type>|(Args&&... args)|
  180. make_shared|shared_ptr<Type is []>|(size_t n)|
  181. make_unique|unique_ptr<Type>|(Args&&... args)|
  182. make_unique|unique_ptr<Type is []>|(size_t n)|unique_ptr<Type[]>({T{}, T{}, ...})
  183. make_unique_for_overwrite|unique_ptr<Type>|()|
  184. make_unique_for_overwrite|unique_ptr<Type[]>|(size_t n)|
  185. allocate_shared|shared_ptr<Type>|(Allocator const& alloc, arguments...)|
  186. allocate_shared|shared_ptr<Type is []>|(Allocator const& alloc, size_t n)|
  187. get_deleter|deleter_type*|(shared_ptr<T> const&)|Provides access to a managed resource's deleter
  188. # ...static pointer casts
  189. static_pointer_cast|shared_ptr<T>|(shared_ptr<U> const&) noexcept|
  190. dynamic_pointer_cast|shared_ptr<T>|(shared_ptr<U> const&) noexcept|
  191. #
  192. # <numeric>
  193. accumulate|Numeric|(Iterator begin, Iterator end, Numeric v0)|Folds a sequence
  194. accumulate|T|(Iterator begin, Iterator end, T v0, LeftAccumulator f(s,xn)->s)|Folds a sequence
  195. adjacent_difference|OIterator[seq_of_differences]|(Iterator begin, Iterator end, OIterator target, Operator diff(x,y)->T)|
  196. inner_product|Numeric|(Iterator1 begin1, Iterator1 end1, Iterator2 begin2, Numeric v0)|
  197. inner_product|T|(Iterator1 begin1, Iterator1 end1, Iterator2 begin2, T v0, Operator sum(T,T)->T, Operator product(T,T)->T )|
  198. iota|void|(Iterator begin, Iterator end, T value )|Fills a sequence incrementally
  199. partial_sum|OIterator[seq_of_sums]|(Iterator begin, Iterator end, OIterator target)|
  200. partial_sum|OIterator[seq_of_sums]|(Iterator begin, Iterator end, OIterator target, Operator sum(x,y)->T)|
  201. gcd|Integer|(Integer m, Integer n)|
  202. lcm|Integer|(Integer m, Integer n)|
  203. #
  204. # <random>
  205. generate_canonical|Real|<Real,bits>(Generator&)|
  206. #
  207. # <regex>
  208. #
  209. # <ios>, <iomanip>, <iostream>
  210. setbase|(streamable)|(int = {8, 10, 16})|
  211. setfill|(streamable)|(stream_char = ' ')|
  212. setprecision|(streamable)|(int precision)|
  213. setw|(streamable)|(int field_width = 0)|
  214. setiosflags|(streamable)|( std::ios_base::fmtflags )|
  215. resetiosflags|(streamable)|( std::ios_base::fmtflags )|
  216. get_time|(in-streamable)|(tm* storage, stream_char* format)|Reads POSIX-formatted time/date.
  217. put_time|(out-streamable)|(tm const* storage, stream_char* format)|Writes POSIX-formatted time/date.
  218. #
  219. # <system_error>
  220. generic_category|error_category("generic")|() noexcept|
  221. system_category|error_category("system")|() noexcept|
  222. make_error_code|error_code|(std::errc c)|
  223. make_error_condition|error_condition|(std::errc c)|
  224. #
  225. # <tuple>
  226. make_tuple|tuple<T0,T1,...>|(T0 a0, T1 a1, ...)|Wraps various objects in a tuple
  227. forward_as_tuple|tuple<Types&&...>|<Types&&...>(types&&...)|
  228. tie|tuple<A0&,A1&,...>|(tuple<A0,A1,...>)|Ties a tuple into references to objects
  229. make_from_tuple|T|<T>(Args... args)|
  230. get<k>|A_k|<k>(tuple<A0,...,A_k,...>)|Gets the 'k'th element of a tuple
  231. get|A_k|<k>(tuple<A0,...,A_k,...>)|Gets the 'k'th element of a tuple
  232. get|A_k|<type>(tuple<A0...,A_k,...>)|Gets the element with type 'type'
  233. apply|__undetermined__|(Functor& f, tuple args...)|
  234. #
  235. # <type_traits>
  236. #
  237. # <utility>
  238. swap|void|(T& ta, T& tb)|Swaps two values
  239. make_pair|pair<A,B>|(A a, B b)|Wraps two objects in a pair
  240. declval|T&&|<T>()|Obtains a reference in unevaluated context
  241. exchange|T|(T& obj, T&& new_value)|
  242. move|referenceless(T)&&|(T&& to_be_moved)|Turns a variable into a rvalue-reference
  243. forward|T&&|(referenceless(T)& to_be_forwarded)|
  244. as_const|T const&|(T const? &)|Returns a const view of an object
  245. in_range|<T> bool|(U u -> T?)|
  246. #
  247. # <cmath>, <ccomplex>
  248. #
  249. # end