HomeSort by: relevance | last modified time | path
    Searched defs:unordered_set (Results 1 - 4 of 4) sorted by relevancy

  /src/external/gpl3/gcc/dist/libstdc++-v3/include/tr1/
unordered_set.h 1 // TR1 unordered_set implementation -*- C++ -*-
25 /** @file tr1/unordered_set.h
27 * Do not attempt to use it directly. @headername{tr1/unordered_set}
173 class unordered_set class in namespace:tr1
186 unordered_set(size_type __n = 10, function in class:tr1::unordered_set
194 unordered_set(_InputIterator __f, _InputIterator __l, function in class:tr1::unordered_set
255 swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
256 unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/tr1/
unordered_set.h 1 // TR1 unordered_set implementation -*- C++ -*-
25 /** @file tr1/unordered_set.h
27 * Do not attempt to use it directly. @headername{tr1/unordered_set}
173 class unordered_set class in namespace:tr1
186 unordered_set(size_type __n = 10, function in class:tr1::unordered_set
194 unordered_set(_InputIterator __f, _InputIterator __l, function in class:tr1::unordered_set
255 swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
256 unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
unordered_set.h 0 // unordered_set implementation -*- C++ -*-
25 /** @file bits/unordered_set.h
27 * Do not attempt to use it directly. @headername{unordered_set}
43 /// Base types for unordered_set.
83 * @headerfile unordered_set
104 class unordered_set class
142 unordered_set() = default;
152 unordered_set(size_type __n, function in class:unordered_set
160 * @brief Builds an %unordered_set from a range.
168 * Create an %unordered_set consisting of copies of the elements fro
173 unordered_set(_InputIterator __first, _InputIterator __last, function in class:unordered_set
192 unordered_set(const allocator_type& __a) function in class:unordered_set
201 unordered_set(const unordered_set& __uset, function in class:unordered_set
228 unordered_set(initializer_list<value_type> __l, function in class:unordered_set
236 unordered_set(size_type __n, const allocator_type& __a) function in class:unordered_set
240 unordered_set(size_type __n, const hasher& __hf, function in class:unordered_set
246 unordered_set(_InputIterator __first, _InputIterator __last, function in class:unordered_set
253 unordered_set(_InputIterator __first, _InputIterator __last, function in class:unordered_set
259 unordered_set(initializer_list<value_type> __l, function in class:unordered_set
265 unordered_set(initializer_list<value_type> __l, function in class:unordered_set
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
unordered_set.h 0 // unordered_set implementation -*- C++ -*-
25 /** @file bits/unordered_set.h
27 * Do not attempt to use it directly. @headername{unordered_set}
38 /// Base types for unordered_set.
78 * @headerfile unordered_set
99 class unordered_set class
137 unordered_set() = default;
147 unordered_set(size_type __n, function in class:unordered_set
155 * @brief Builds an %unordered_set from a range.
163 * Create an %unordered_set consisting of copies of the elements fro
168 unordered_set(_InputIterator __first, _InputIterator __last, function in class:unordered_set
187 unordered_set(const allocator_type& __a) function in class:unordered_set
196 unordered_set(const unordered_set& __uset, function in class:unordered_set
223 unordered_set(initializer_list<value_type> __l, function in class:unordered_set
231 unordered_set(size_type __n, const allocator_type& __a) function in class:unordered_set
235 unordered_set(size_type __n, const hasher& __hf, function in class:unordered_set
241 unordered_set(_InputIterator __first, _InputIterator __last, function in class:unordered_set
248 unordered_set(_InputIterator __first, _InputIterator __last, function in class:unordered_set
254 unordered_set(initializer_list<value_type> __l, function in class:unordered_set
260 unordered_set(initializer_list<value_type> __l, function in class:unordered_set
    [all...]

Completed in 20 milliseconds