OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:buckets
(Results
151 - 175
of
1047
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/external/llvm/tools/llvm-dwp/
llvm-dwp.cpp
286
std::vector<unsigned>
Buckets
(NextPowerOf2(3 * IndexEntries.size() / 2));
287
uint64_t Mask =
Buckets
.size() - 1;
293
while (
Buckets
[H]) {
294
assert(S != IndexEntries.begin()[
Buckets
[H] - 1].first &&
298
Buckets
[H] = i + 1;
306
Out.EmitIntValue(
Buckets
.size(), 4); // Num
Buckets
309
for (const auto &I :
Buckets
)
313
for (const auto &I :
Buckets
)
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
SmallPtrSet.h
41
/// Large sets use a classic exponentially-probed hash table. Empty
buckets
are
50
/// SmallArray - Points to a fixed size set of
buckets
, used in 'small mode'.
52
/// CurArray - This is the current set of
buckets
. If equal to SmallArray,
135
/// Grow - Allocate a larger backing store for the
buckets
and move it over.
/frameworks/base/core/java/com/android/internal/util/
ExponentiallyBucketedHistogram.java
35
* @param numBuckets The number of
buckets
. The highest bucket is for all value >=
/frameworks/base/core/proto/android/service/
netstats.proto
104
repeated NetworkStatsHistoryBucketProto
buckets
= 2;
/frameworks/rs/tests/java_api/RsTest/src/com/android/rs/test/
reduce.rs
211
#define
BUCKETS
256
212
typedef uint32_t Histogram[
BUCKETS
];
217
for (int i = 0; i <
BUCKETS
; ++i)
227
for (int i = 1; i <
BUCKETS
; ++i)
/packages/apps/Car/libs/car-apps-common/src/com/android/car/apps/common/
BitmapDownloader.java
77
// Bitmap cache is divided into following
buckets
by height:
80
// Different bitmap cache
buckets
save different bitmap cache items.
297
// 2. find un-scaled bitmap in smaller
buckets
. If the un-scaled bitmap exists
298
// in higher
buckets
, we still need to scale it down. Right now we just
/packages/inputmethods/LatinIME/native/jni/src/dictionary/utils/
bloom_filter.h
58
// dictionaries, so n = 100. 1024
buckets
give us m = 1024.
/device/google/contexthub/firmware/os/algos/calibration/accelerometer/
accel_cal.h
19
* (nx,nxb,ny,nyb,nz,nzb,nle). Once the
buckets
are full the data is used to
118
// Total
Buckets
counter.
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/
test_tuple.py
61
#
buckets
when tossing 252,600 balls into 2**32
buckets
/external/freetype/src/cache/
ftccache.h
77
( ( cache )->
buckets
+ \
148
FTC_Node*
buckets
;
member in struct:FTC_CacheRec_
/external/iptables/extensions/
libxt_hashlimit.man
1
\fBhashlimit\fP uses hash
buckets
to express a rate limiting match (like the
44
The number of
buckets
of the hash table
/external/libchrome/base/metrics/
sample_vector.cc
92
// Sample is smaller than current bucket range. We scan
buckets
from
102
// approaches if we knew that the
buckets
were linearly distributed.
/prebuilts/gdb/darwin-x86/lib/python2.7/test/
test_tuple.py
61
#
buckets
when tossing 252,600 balls into 2**32
buckets
/prebuilts/gdb/linux-x86/lib/python2.7/test/
test_tuple.py
61
#
buckets
when tossing 252,600 balls into 2**32
buckets
/prebuilts/go/darwin-x86/pkg/darwin_amd64/internal/syscall/windows/
sysdll.a
30
go17ld ?"".Add ?(type.map[string]bool ?"".IsSystemDLL ?"runtime.mapassign ?0runtime.morestack_noctxt ?.autotmp_0 ?type.string ?~r1 ?dll ?Tgclocals·674aa069cc12c55f8f0b1ca7727b909e ?Tgclocals·db9a6544d085c0622e79e6568b99b095 ?j$GOROOT/src/internal/syscall/windows/sysdll/sysdll.go?"".init ?"".initdone· ?"runtime.throwinit ?runtime.makemap ?(runtime.writeBarrier ?.runtime.writebarrierptr ?Tgclocals·33cdeccccebe80329f1fdbee7f5874cb ?go.info."".Add ?go.info.string ?go.info."".init ?type.uint8 ?"runtime.gcbits.01 ?0type..namedata.*[]uint8. ?type.*[]uint8 ? runtime.algarray ?type.[]uint8 ?2type..namedata.*[8]uint8. ?type.*[8]uint8 ?type.[8]uint8 ?runtime.gcbits. ?2type..namedata.*[]string. ?type.*[]string ?type.[]string ?4type..namedata.*[8]string. ?type.*[8]string ?(type.noalg.[8]string ?&runtime.gcbits.5555 ?.type..namedata.*[]bool. ?type.*[]bool ?type.[]bool ?type.bool ?0type..namedata.*[8]bool. ?type.*[8]bool ?$type.noalg.[8]bool ?Ntype..namedata.*map.bucket[string]bool. ?8type.*map.bucket[string]bool ?Btype.noalg.map.bucket[string]bool ?*runtime.gcbits.aaaa04 ?$type..importpath.. ?.type..namedata.topbits. ?(type..namedata.keys. ?,type..namedata.values. ?0type..namedata.overflow. ?Htype..namedata.*map.hdr[string]bool. ?2type.*map.hdr[string]bool ?<type.noalg.map.hdr[string]bool ?"runtime.gcbits.2c ?*type..namedata.count. ?*type..namedata.flags. ?"type..namedata.B. ?2type..namedata.noverflow. ?*type..namedata.hash0. ?.type..namedata.
buckets
. ?4type..namedata.oldbuckets. ?2type..namedata.nevacuate. ?type.int ?type.uint16 ?type.uint32 ?type.uintptr ?&type.unsafe.Pointer ?Btype..namedata.**map[string]bool. ?,type.**map[string]bool ?*type.*map[string]bool ?@type..namedata.*map[string]bool. ??#?eH?% H;avnH??8H?l$0H?l$0H?D$@H?D$ H?L$HH?L$(H? H?$H? H?T$H?T$ H?T$? H?D$? H?D$@H?D$PH?D$HH?D$XH?l$0H??8?? ?y???pio ? 4B
45
*[8]string ??o 6 UU? x US?> *[]bool W??? 6 ??? *[8]bool ?hZ 6 s?5? *map.bucket[string]bool ?[?E 6 ?? topbits keys values overflow? ? 2aB? ? ? *map.hdr[string]bool ~? 6 , count flags B noverflow hash0
buckets