| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _unordered_map.h | 100 { _M_ht.insert_unique(__f, __l); }
107 { _M_ht.insert_unique(__f, __l); }
114 { _M_ht.insert_unique(__f, __l); }
134 { return _M_ht.insert_unique(__obj); }
136 { return _M_ht.insert_unique(__obj); }
142 { _M_ht.insert_unique(__f,__l); }
145 { _M_ht.insert_unique(__f, __l); }
|
| _unordered_set.h | 94 { _M_ht.insert_unique(__f, __l); }
101 { _M_ht.insert_unique(__f, __l); }
108 { _M_ht.insert_unique(__f, __l); }
128 { return _M_ht.insert_unique(__obj); }
130 { return _M_ht.insert_unique(__obj); }
136 {_M_ht.insert_unique(__f, __l); }
139 { _M_ht.insert_unique(__f,__l); }
|
| _tree.c | 25 * Modified CRP 7/10/00 for improved conformance / efficiency on insert_unique /
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) { function in class:_Alloc
432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, function in class:_Alloc
436 // if the container is empty, fall back on insert_unique.
438 return insert_unique(__val).first;
475 return insert_unique(__val).first;
486 return insert_unique(__val).first;
530 return insert_unique(__val).first;
552 // Unlike insert_unique, can't avoid doing a comparison here.
|
| /external/stlport/stlport/stl/ |
| _tree.c | 25 * Modified CRP 7/10/00 for improved conformance / efficiency on insert_unique /
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) { function in class:_Alloc
432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, function in class:_Alloc
436 // if the container is empty, fall back on insert_unique.
438 return insert_unique(__val).first;
475 return insert_unique(__val).first;
486 return insert_unique(__val).first;
530 return insert_unique(__val).first;
552 // Unlike insert_unique, can't avoid doing a comparison here.
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 25 * Modified CRP 7/10/00 for improved conformance / efficiency on insert_unique /
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) { function in class:_Alloc
432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, function in class:_Alloc
436 // if the container is empty, fall back on insert_unique.
438 return insert_unique(__val).first;
475 return insert_unique(__val).first;
486 return insert_unique(__val).first;
530 return insert_unique(__val).first;
552 // Unlike insert_unique, can't avoid doing a comparison here.
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 25 * Modified CRP 7/10/00 for improved conformance / efficiency on insert_unique /
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) { function in class:_Alloc
432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, function in class:_Alloc
436 // if the container is empty, fall back on insert_unique.
438 return insert_unique(__val).first;
475 return insert_unique(__val).first;
486 return insert_unique(__val).first;
530 return insert_unique(__val).first;
552 // Unlike insert_unique, can't avoid doing a comparison here.
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 25 * Modified CRP 7/10/00 for improved conformance / efficiency on insert_unique /
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) { function in class:_Alloc
432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, function in class:_Alloc
436 // if the container is empty, fall back on insert_unique.
438 return insert_unique(__val).first;
475 return insert_unique(__val).first;
486 return insert_unique(__val).first;
530 return insert_unique(__val).first;
552 // Unlike insert_unique, can't avoid doing a comparison here.
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 25 * Modified CRP 7/10/00 for improved conformance / efficiency on insert_unique /
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) { function in class:_Alloc
432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, function in class:_Alloc
436 // if the container is empty, fall back on insert_unique.
438 return insert_unique(__val).first;
475 return insert_unique(__val).first;
486 return insert_unique(__val).first;
530 return insert_unique(__val).first;
552 // Unlike insert_unique, can't avoid doing a comparison here.
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 25 * Modified CRP 7/10/00 for improved conformance / efficiency on insert_unique /
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) { function in class:_Alloc
432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, function in class:_Alloc
436 // if the container is empty, fall back on insert_unique.
438 return insert_unique(__val).first;
475 return insert_unique(__val).first;
486 return insert_unique(__val).first;
530 return insert_unique(__val).first;
552 // Unlike insert_unique, can't avoid doing a comparison here.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/backward/ |
| hashtable.h | 431 insert_unique(const value_type& __obj) function in class:hashtable
452 insert_unique(_InputIterator __f, _InputIterator __l) function in class:hashtable
453 { insert_unique(__f, __l, __iterator_category(__f)); }
462 insert_unique(_InputIterator __f, _InputIterator __l, function in class:hashtable
466 insert_unique(*__f);
480 insert_unique(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/backward/ |
| hashtable.h | 451 insert_unique(const value_type& __obj) function in class:hashtable
472 insert_unique(_InputIterator __f, _InputIterator __l) function in class:hashtable
473 { insert_unique(__f, __l, __iterator_category(__f)); }
482 insert_unique(_InputIterator __f, _InputIterator __l, function in class:hashtable
486 insert_unique(*__f);
500 insert_unique(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/backward/ |
| hashtable.h | 451 insert_unique(const value_type& __obj) function in class:hashtable
472 insert_unique(_InputIterator __f, _InputIterator __l) function in class:hashtable
473 { insert_unique(__f, __l, __iterator_category(__f)); }
482 insert_unique(_InputIterator __f, _InputIterator __l, function in class:hashtable
486 insert_unique(*__f);
500 insert_unique(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/backward/ |
| hashtable.h | 431 insert_unique(const value_type& __obj) function in class:hashtable
452 insert_unique(_InputIterator __f, _InputIterator __l) function in class:hashtable
453 { insert_unique(__f, __l, __iterator_category(__f)); }
462 insert_unique(_InputIterator __f, _InputIterator __l, function in class:hashtable
466 insert_unique(*__f);
480 insert_unique(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/backward/ |
| hashtable.h | 431 insert_unique(const value_type& __obj) function in class:hashtable
452 insert_unique(_InputIterator __f, _InputIterator __l) function in class:hashtable
453 { insert_unique(__f, __l, __iterator_category(__f)); }
462 insert_unique(_InputIterator __f, _InputIterator __l, function in class:hashtable
466 insert_unique(*__f);
480 insert_unique(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/backward/ |
| hashtable.h | 431 insert_unique(const value_type& __obj) function in class:hashtable
452 insert_unique(_InputIterator __f, _InputIterator __l) function in class:hashtable
453 { insert_unique(__f, __l, __iterator_category(__f)); }
462 insert_unique(_InputIterator __f, _InputIterator __l, function in class:hashtable
466 insert_unique(*__f);
480 insert_unique(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/backward/ |
| hashtable.h | 431 insert_unique(const value_type& __obj) function in class:hashtable
452 insert_unique(_InputIterator __f, _InputIterator __l) function in class:hashtable
453 { insert_unique(__f, __l, __iterator_category(__f)); }
462 insert_unique(_InputIterator __f, _InputIterator __l, function in class:hashtable
466 insert_unique(*__f);
480 insert_unique(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/backward/ |
| hashtable.h | 451 insert_unique(const value_type& __obj) function in class:hashtable
472 insert_unique(_InputIterator __f, _InputIterator __l) function in class:hashtable
473 { insert_unique(__f, __l, __iterator_category(__f)); }
482 insert_unique(_InputIterator __f, _InputIterator __l, function in class:hashtable
486 insert_unique(*__f);
500 insert_unique(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/backward/ |
| hashtable.h | 450 insert_unique(const value_type& __obj) function in class:hashtable
471 insert_unique(_InputIterator __f, _InputIterator __l) function in class:hashtable
472 { insert_unique(__f, __l, __iterator_category(__f)); }
481 insert_unique(_InputIterator __f, _InputIterator __l, function in class:hashtable
485 insert_unique(*__f);
499 insert_unique(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/backward/ |
| hashtable.h | 451 insert_unique(const value_type& __obj) function in class:hashtable
472 insert_unique(_InputIterator __f, _InputIterator __l) function in class:hashtable
473 { insert_unique(__f, __l, __iterator_category(__f)); }
482 insert_unique(_InputIterator __f, _InputIterator __l, function in class:hashtable
486 insert_unique(*__f);
500 insert_unique(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/backward/ |
| hashtable.h | 450 insert_unique(const value_type& __obj) function in class:hashtable
471 insert_unique(_InputIterator __f, _InputIterator __l) function in class:hashtable
472 { insert_unique(__f, __l, __iterator_category(__f)); }
481 insert_unique(_InputIterator __f, _InputIterator __l, function in class:hashtable
485 insert_unique(*__f);
499 insert_unique(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/backward/ |
| hashtable.h | 449 insert_unique(const value_type& __obj) function in class:hashtable
470 insert_unique(_InputIterator __f, _InputIterator __l) function in class:hashtable
471 { insert_unique(__f, __l, __iterator_category(__f)); }
480 insert_unique(_InputIterator __f, _InputIterator __l, function in class:hashtable
484 insert_unique(*__f);
498 insert_unique(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable
[all...] |
