OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:kLimit
(Results
1 - 8
of
8
) sorted by null
/external/chromium/base/
utf_offset_string_conversions_unittest.cc
85
const size_t
kLimit
= 10;
91
LimitOffset<std::wstring>(
kLimit
));
95
if (*ti <
kLimit
&& *ti != kNpos)
105
LimitOffset<std::wstring>(
kLimit
));
109
if (*ti <
kLimit
&& *ti != kNpos)
/external/chromium_org/base/strings/
utf_offset_string_conversions_unittest.cc
66
const size_t
kLimit
= 10;
72
LimitOffset<string16>(
kLimit
));
76
if (*ti <
kLimit
&& *ti != kNpos)
86
LimitOffset<string16>(
kLimit
));
90
if (*ti <
kLimit
&& *ti != kNpos)
/external/chromium_org/webkit/browser/appcache/
appcache_url_request_job.cc
185
const int64
kLimit
= 500 * 1000;
187
handler_source_buffer_->SetCapacity(
kLimit
);
192
kLimit
,
view_appcache_internals_job.cc
588
const int64
kLimit
= 100 * 1000;
590
std::min(
kLimit
, response_info->response_data_size());
/external/chromium_org/v8/test/cctest/
test-regexp.cc
576
static const unsigned
kLimit
= 1000;
579
bool seen[
kLimit
];
580
for (unsigned i = 0; i <
kLimit
; i++) seen[i] = false;
582
for (unsigned k = 0; k <
kLimit
; k++) \
587
unsigned next = PseudoRandom(i, j) %
kLimit
;
608
int val = PseudoRandom(j, i) %
kLimit
;
615
val = PseudoRandom(i + j, i - j) %
kLimit
;
630
static const int
kLimit
= 1000;
637
range[j] = PseudoRandom(i + 25, j + 87) %
kLimit
;
653
for (int p = 0; p <
kLimit
; p++)
[
all
...]
test-hashing.cc
264
static const uint32_t
kLimit
= 1000;
267
check(PseudoRandom(i, j) %
kLimit
);
/external/v8/test/cctest/
test-regexp.cc
556
static const unsigned
kLimit
= 1000;
559
bool seen[
kLimit
];
560
for (unsigned i = 0; i <
kLimit
; i++) seen[i] = false;
562
for (unsigned k = 0; k <
kLimit
; k++) \
567
unsigned next = PseudoRandom(i, j) %
kLimit
;
588
int val = PseudoRandom(j, i) %
kLimit
;
595
val = PseudoRandom(i + j, i - j) %
kLimit
;
610
static const int
kLimit
= 1000;
617
range[j] = PseudoRandom(i + 25, j + 87) %
kLimit
;
633
for (int p = 0; p <
kLimit
; p++)
[
all
...]
test-hashing.cc
252
static const uint32_t
kLimit
= 1000;
255
check(PseudoRandom(i, j) %
kLimit
);
Completed in 611 milliseconds