OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:__new_node
(Results
1 - 14
of
14
) sorted by null
/external/stlport/stlport/stl/
_tree.c
356
_Base_ptr
__new_node
;
local
359
__new_node
= _M_create_node(__val);
360
_S_left(__parent) =
__new_node
; // also makes _M_leftmost() =
__new_node
361
_M_root() =
__new_node
;
362
_M_rightmost() =
__new_node
;
367
__new_node
= _M_create_node(__val);
368
_S_left(__parent) =
__new_node
;
370
_M_leftmost() =
__new_node
; // maintain _M_leftmost() pointing to min node
373
__new_node
= _M_create_node(__val)
[
all
...]
/ndk/sources/cxx-stl/stlport/stlport/stl/
_tree.c
356
_Base_ptr
__new_node
;
local
359
__new_node
= _M_create_node(__val);
360
_S_left(__parent) =
__new_node
; // also makes _M_leftmost() =
__new_node
361
_M_root() =
__new_node
;
362
_M_rightmost() =
__new_node
;
367
__new_node
= _M_create_node(__val);
368
_S_left(__parent) =
__new_node
;
370
_M_leftmost() =
__new_node
; // maintain _M_leftmost() pointing to min node
373
__new_node
= _M_create_node(__val)
[
all
...]
/prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_tree.c
356
_Base_ptr
__new_node
;
local
359
__new_node
= _M_create_node(__val);
360
_S_left(__parent) =
__new_node
; // also makes _M_leftmost() =
__new_node
361
_M_root() =
__new_node
;
362
_M_rightmost() =
__new_node
;
367
__new_node
= _M_create_node(__val);
368
_S_left(__parent) =
__new_node
;
370
_M_leftmost() =
__new_node
; // maintain _M_leftmost() pointing to min node
373
__new_node
= _M_create_node(__val)
[
all
...]
/prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_tree.c
356
_Base_ptr
__new_node
;
local
359
__new_node
= _M_create_node(__val);
360
_S_left(__parent) =
__new_node
; // also makes _M_leftmost() =
__new_node
361
_M_root() =
__new_node
;
362
_M_rightmost() =
__new_node
;
367
__new_node
= _M_create_node(__val);
368
_S_left(__parent) =
__new_node
;
370
_M_leftmost() =
__new_node
; // maintain _M_leftmost() pointing to min node
373
__new_node
= _M_create_node(__val)
[
all
...]
/prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_tree.c
356
_Base_ptr
__new_node
;
local
359
__new_node
= _M_create_node(__val);
360
_S_left(__parent) =
__new_node
; // also makes _M_leftmost() =
__new_node
361
_M_root() =
__new_node
;
362
_M_rightmost() =
__new_node
;
367
__new_node
= _M_create_node(__val);
368
_S_left(__parent) =
__new_node
;
370
_M_leftmost() =
__new_node
; // maintain _M_leftmost() pointing to min node
373
__new_node
= _M_create_node(__val)
[
all
...]
/prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/
_tree.c
356
_Base_ptr
__new_node
;
local
359
__new_node
= _M_create_node(__val);
360
_S_left(__parent) =
__new_node
; // also makes _M_leftmost() =
__new_node
361
_M_root() =
__new_node
;
362
_M_rightmost() =
__new_node
;
367
__new_node
= _M_create_node(__val);
368
_S_left(__parent) =
__new_node
;
370
_M_leftmost() =
__new_node
; // maintain _M_leftmost() pointing to min node
373
__new_node
= _M_create_node(__val)
[
all
...]
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
hashtable.h
928
_Node*
__new_node
= _M_allocate_node(std::forward<_Arg>(__v));
local
999
_Node*
__new_node
= _M_allocate_node(std::forward<_Arg>(__v));
local
[
all
...]
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/
hashtable.h
854
_Node*
__new_node
= _M_allocate_node(__v);
local
865
__new_node
->_M_next = _M_buckets[__n];
866
this->_M_store_code(
__new_node
, __code);
867
_M_buckets[__n] =
__new_node
;
869
return iterator(
__new_node
, _M_buckets + __n);
873
_M_deallocate_node(
__new_node
);
924
_Node*
__new_node
= _M_allocate_node(__v);
local
[
all
...]
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/
hashtable.h
928
_Node*
__new_node
= _M_allocate_node(std::forward<_Arg>(__v));
local
999
_Node*
__new_node
= _M_allocate_node(std::forward<_Arg>(__v));
local
[
all
...]
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/
hashtable.h
854
_Node*
__new_node
= _M_allocate_node(__v);
local
865
__new_node
->_M_next = _M_buckets[__n];
866
this->_M_store_code(
__new_node
, __code);
867
_M_buckets[__n] =
__new_node
;
869
return iterator(
__new_node
, _M_buckets + __n);
873
_M_deallocate_node(
__new_node
);
924
_Node*
__new_node
= _M_allocate_node(__v);
local
[
all
...]
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
hashtable.h
928
_Node*
__new_node
= _M_allocate_node(std::forward<_Arg>(__v));
local
999
_Node*
__new_node
= _M_allocate_node(std::forward<_Arg>(__v));
local
[
all
...]
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/
hashtable.h
854
_Node*
__new_node
= _M_allocate_node(__v);
local
865
__new_node
->_M_next = _M_buckets[__n];
866
this->_M_store_code(
__new_node
, __code);
867
_M_buckets[__n] =
__new_node
;
869
return iterator(
__new_node
, _M_buckets + __n);
873
_M_deallocate_node(
__new_node
);
924
_Node*
__new_node
= _M_allocate_node(__v);
local
[
all
...]
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
hashtable.h
1172
_Node*
__new_node
= _M_allocate_node(std::forward<_Args>(__args)...);
local
1230
_Node*
__new_node
= _M_allocate_node(std::forward<_Args>(__args)...);
local
1292
_Node*
__new_node
= nullptr;
local
1362
_Node*
__new_node
= nullptr;
local
[
all
...]
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/
hashtable.h
854
_Node*
__new_node
= _M_allocate_node(__v);
local
865
__new_node
->_M_next = _M_buckets[__n];
866
this->_M_store_code(
__new_node
, __code);
867
_M_buckets[__n] =
__new_node
;
869
return iterator(
__new_node
, _M_buckets + __n);
873
_M_deallocate_node(
__new_node
);
924
_Node*
__new_node
= _M_allocate_node(__v);
local
[
all
...]
Completed in 831 milliseconds