OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:heaps
(Results
26 - 50
of
166
) sorted by null
1
2
3
4
5
6
7
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binomial_heap_base_/
constructors_destructor_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
find_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
debug_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
erase_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binomial_heap_base_/
constructors_destructor_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
find_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
debug_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
erase_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/binomial_heap_base_/
constructors_destructor_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
find_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
debug_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
erase_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/binomial_heap_base_/
constructors_destructor_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
find_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
debug_fn_imps.hpp
38
* Contains an implementation class for a base of binomial
heaps
.
/external/libchrome/base/trace_event/
process_memory_dump.cc
217
value->BeginDictionary("
heaps
");
220
value->EndDictionary(); // "
heaps
"
/system/core/libion/tests/
invalid_values_test.cpp
64
/* no
heaps
*/
87
/* no
heaps
*/
/prebuilts/gdb/darwin-x86/lib/python2.7/
heapq.py
5
Heaps
are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
39
Heaps
are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
87
studied, and
heaps
are good for this, as they are reasonably speedy,
92
Heaps
are also very useful in big disk sorts. You most probably all
109
vanishes, you switch
heaps
and start a new run. Clever and quite
112
In a word,
heaps
are useful memory structures to know. I use them in
256
# The child indices of heap index pos are already
heaps
, and we want to make
/prebuilts/gdb/linux-x86/lib/python2.7/
heapq.py
5
Heaps
are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
39
Heaps
are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
87
studied, and
heaps
are good for this, as they are reasonably speedy,
92
Heaps
are also very useful in big disk sorts. You most probably all
109
vanishes, you switch
heaps
and start a new run. Clever and quite
112
In a word,
heaps
are useful memory structures to know. I use them in
256
# The child indices of heap index pos are already
heaps
, and we want to make
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
heapq.py
5
Heaps
are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
39
Heaps
are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
87
studied, and
heaps
are good for this, as they are reasonably speedy,
92
Heaps
are also very useful in big disk sorts. You most probably all
109
vanishes, you switch
heaps
and start a new run. Clever and quite
112
In a word,
heaps
are useful memory structures to know. I use them in
256
# The child indices of heap index pos are already
heaps
, and we want to make
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/
heapq.py
5
Heaps
are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
39
Heaps
are arrays for which a[k] <= a[2*k+1] and a[k] <= a[2*k+2] for
87
studied, and
heaps
are good for this, as they are reasonably speedy,
92
Heaps
are also very useful in big disk sorts. You most probably all
109
vanishes, you switch
heaps
and start a new run. Clever and quite
112
In a word,
heaps
are useful memory structures to know. I use them in
256
# The child indices of heap index pos are already
heaps
, and we want to make
/hardware/qcom/display/msm8960/libgralloc/
alloc_controller.cpp
80
// System
heaps
cannot be uncached
199
//have other secure
heaps
, we can change this.
219
// SF + IOMMU
heaps
, so that bypass can work
/art/build/
Android.common.mk
27
# our
heaps
.
/device/asus/fugu/sepolicy/
file_contexts
34
/sys/kernel/debug/ion/
heaps
u:object_r:gpu_pid_stats_file:s0
/device/huawei/angler/dumpstate/
dumpstate.cpp
31
run_command("ION
HEAPS
", 5, SU_PATH, "root", "/system/bin/sh", "-c", "for d in $(ls -d /d/ion/*); do for f in $(ls $d); do echo --- $d/$f; cat $d/$f; done; done", NULL);
Completed in 459 milliseconds
1
2
3
4
5
6
7