OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:kBase
(Results
1 - 8
of
8
) sorted by null
/external/chromium/sdch/open-vcdiff/src/
rolling_hash_test.cc
26
static const uint32_t
kBase
= RollingHashUtil::
kBase
;
34
EXPECT_EQ(operand %
kBase
, RollingHashUtil::ModBase(operand));
35
EXPECT_EQ(static_cast<uint32_t>((-static_cast<int32_t>(operand)) %
kBase
),
60
EXPECT_EQ(0U,
kBase
& (
kBase
- 1));
67
TestModBase(
kBase
- 1);
68
TestModBase(
kBase
);
69
TestModBase(
kBase
+ 1);
rolling_hash.h
36
// All hashes are returned modulo "
kBase
". Current implementation requires
37
//
kBase
<= 2^32/kMult to avoid overflow. Also,
kBase
must be a power of two
39
static const uint32_t
kBase
= (1 << 23);
41
// Returns operand %
kBase
, assuming that
kBase
is a power of two.
43
return operand & (
kBase
- 1);
48
// result <
kBase
58
// The C++ mod operation (operand %
kBase
) may produce different results for
78
// (ptr[0] * kMult) + ptr[1] is not large enough to exceed
kBase
, thu
[
all
...]
/external/chromium_org/sdch/open-vcdiff/src/
rolling_hash_test.cc
26
static const uint32_t
kBase
= RollingHashUtil::
kBase
;
34
EXPECT_EQ(operand %
kBase
, RollingHashUtil::ModBase(operand));
35
EXPECT_EQ(static_cast<uint32_t>((-static_cast<int32_t>(operand)) %
kBase
),
60
EXPECT_EQ(0U,
kBase
& (
kBase
- 1));
67
TestModBase(
kBase
- 1);
68
TestModBase(
kBase
);
69
TestModBase(
kBase
+ 1);
rolling_hash.h
37
// All hashes are returned modulo "
kBase
". Current implementation requires
38
//
kBase
<= 2^32/kMult to avoid overflow. Also,
kBase
must be a power of two
40
static const uint32_t
kBase
= (1 << 23);
42
// Returns operand %
kBase
, assuming that
kBase
is a power of two.
44
return operand & (
kBase
- 1);
49
// result <
kBase
59
// The C++ mod operation (operand %
kBase
) may produce different results for
79
// (ptr[0] * kMult) + ptr[1] is not large enough to exceed
kBase
, thu
[
all
...]
/external/open-vcdiff/src/
rolling_hash_test.cc
26
static const uint32_t
kBase
= RollingHashUtil::
kBase
;
34
EXPECT_EQ(operand %
kBase
, RollingHashUtil::ModBase(operand));
35
EXPECT_EQ(static_cast<uint32_t>((-static_cast<int32_t>(operand)) %
kBase
),
60
EXPECT_EQ(0U,
kBase
& (
kBase
- 1));
67
TestModBase(
kBase
- 1);
68
TestModBase(
kBase
);
69
TestModBase(
kBase
+ 1);
rolling_hash.h
37
// All hashes are returned modulo "
kBase
". Current implementation requires
38
//
kBase
<= 2^32/kMult to avoid overflow. Also,
kBase
must be a power of two
40
static const uint32_t
kBase
= (1 << 23);
42
// Returns operand %
kBase
, assuming that
kBase
is a power of two.
44
return operand & (
kBase
- 1);
49
// result <
kBase
59
// The C++ mod operation (operand %
kBase
) may produce different results for
79
// (ptr[0] * kMult) + ptr[1] is not large enough to exceed
kBase
, thu
[
all
...]
/external/chromium/base/
string_number_conversions.cc
166
// - constant
kBase
, the base in which to interpret the input
221
if (traits::
kBase
== 16 && end - begin >= 2 && *begin == '0' &&
229
if (!CharToDigit<traits::
kBase
>(*current, &new_digit)) {
237
*output *= traits::
kBase
;
249
if (*output > static_cast<value_type>(traits::max() / traits::
kBase
) ||
250
(*output == static_cast<value_type>(traits::max() / traits::
kBase
) &&
251
new_digit > traits::max() % traits::
kBase
)) {
265
if (*output < traits::min() / traits::
kBase
||
266
(*output == traits::min() / traits::
kBase
&&
267
new_digit > 0 - traits::min() % traits::
kBase
)) {
[
all
...]
/external/chromium_org/base/strings/
string_number_conversions.cc
169
// - constant
kBase
, the base in which to interpret the input
226
if (traits::
kBase
== 16 && end - begin > 2 && *begin == '0' &&
234
if (!CharToDigit<traits::
kBase
>(*current, &new_digit)) {
242
*output *= traits::
kBase
;
254
if (*output > static_cast<value_type>(traits::max() / traits::
kBase
) ||
255
(*output == static_cast<value_type>(traits::max() / traits::
kBase
) &&
256
new_digit > traits::max() % traits::
kBase
)) {
270
if (*output < traits::min() / traits::
kBase
||
271
(*output == traits::min() / traits::
kBase
&&
272
new_digit > 0 - traits::min() % traits::
kBase
)) {
[
all
...]
Completed in 381 milliseconds