Home
last modified time | relevance | path

Searched refs:sparse_array (Results 1 – 7 of 7) sorted by relevance

/external/v8/test/mjsunit/
Darray-indexing.js31 var sparse_array = []; variable
32 sparse_array[100] = 3;
33 sparse_array[200] = undefined;
34 sparse_array[300] = 4;
35 sparse_array[400] = 5;
36 sparse_array[500] = 6;
37 sparse_array[600] = 5;
38 sparse_array[700] = 4;
39 sparse_array[800] = undefined;
40 sparse_array[900] = 3
[all …]
/external/oprofile/libutil++/
Dsparse_array.h15 template <typename I, typename T> class sparse_array {
49 sparse_array & operator+=(sparse_array const & rhs) {
63 sparse_array & operator-=(sparse_array const & rhs) {
DMakefile.am25 sparse_array.h \
/external/oprofile/libpp/
Dsymbol.h30 typedef sparse_array<u32, count_type> count_array_t;
/external/regex-re2/
DMakefile62 util/sparse_array.h\
/external/oprofile/
DChangeLog-2007278 * libutil++/sparse_array.h: size() return the max index while we
697 * libutil++/sparse_array.h: represent count_array_t as a sparse
DTODO163 o can we find a more efficient implementation for sparse_array ?