OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:BlockHash
(Results
1 - 7
of
7
) sorted by null
/external/chromium/sdch/open-vcdiff/src/
blockhash.cc
17
#include "
blockhash
.h"
28
BlockHash
::
BlockHash
(const char* source_data,
38
BlockHash
::~
BlockHash
() { }
43
COMPILE_ASSERT(
BlockHash
::kBlockSize >= 2, kBlockSize_must_be_at_least_2);
52
COMPILE_ASSERT((
BlockHash
::kBlockSize & (
BlockHash
::kBlockSize - 1)) == 0,
55
bool
BlockHash
::Init(bool populate_hash_table) {
59
LOG(DFATAL) << "Init() called twice for same
BlockHash
object" << LOG_ENDL
[
all
...]
blockhash.h
36
// entry in the
BlockHash
corresponding to each kBlockSize bytes
46
class
BlockHash
{
58
// for a new
BlockHash
. However, it also doubles the minimum
101
// of the
BlockHash
for which the match was found.
114
// A
BlockHash
is created using a buffer of source data. The hash table
123
BlockHash
(const char* source_data, size_t source_size, int starting_offset);
125
~
BlockHash
();
128
// This method must be called after constructing a
BlockHash
object,
137
// classes that inherit from
BlockHash
are expected to call AddBlock()
142
// In the context of the open-vcdiff encoder,
BlockHash
is used for tw
[
all
...]
vcdiffengine.h
25
class
BlockHash
;
93
//
BlockHash
object, and cannot be NULL. If look_for_target_matches is
100
const
BlockHash
* target_hash,
118
const
BlockHash
* hashed_dictionary_;
vcdiffengine.cc
20
#include "
blockhash
.h"
51
hashed_dictionary_ =
BlockHash
::CreateDictionaryHash(dictionary_,
57
if (!RollingHash<
BlockHash
::kBlockSize>::Init()) {
77
// directly to
BlockHash
::FindBestMatch; please see that function
85
const
BlockHash
* target_hash,
90
BlockHash
::Match best_match;
165
if (target_size < static_cast<size_t>(
BlockHash
::kBlockSize)) {
170
RollingHash<
BlockHash
::kBlockSize> hasher;
171
BlockHash
* target_hash = NULL;
175
target_hash =
BlockHash
::CreateTargetHash(target_data
[
all
...]
blockhash_test.cc
17
#include "
blockhash
.h"
28
const int kBlockSize =
BlockHash
::kBlockSize;
36
dh_.reset(
BlockHash
::CreateDictionaryHash(sample_text,
38
th_.reset(
BlockHash
::CreateTargetHash(sample_text, strlen(sample_text), 0));
43
// BlockHashTest is a friend to
BlockHash
. Expose the protected functions
46
return
BlockHash
::BlockContentsMatch(block1, block2);
49
int FirstMatchingBlock(const
BlockHash
& block_hash,
55
int NextMatchingBlock(const
BlockHash
& block_hash,
64
return
BlockHash
::MatchingBytesToLeft(source_match_start,
72
return
BlockHash
::MatchingBytesToRight(source_match_end
[
all
...]
vcencoder_test.cc
23
#include "
blockhash
.h"
709
if (
BlockHash
::kBlockSize < 16) {
729
} else if (
BlockHash
::kBlockSize <= 56) {
765
if (
BlockHash
::kBlockSize < 16) {
769
} else if (
BlockHash
::kBlockSize <= 56) {
[
all
...]
/packages/apps/Exchange/tests/src/com/android/exchange/utility/
CalendarUtilitiesTests.java
362
BlockHash
vcalendar = parseIcsContent(att.mContentBytes);
371
BlockHash
vevent = vcalendar.blocks.get(0);
424
BlockHash
vcalendar = parseIcsContent(att.mContentBytes);
433
BlockHash
vevent = vcalendar.blocks.get(0);
490
BlockHash
vcalendar = parseIcsContent(att.mContentBytes);
503
BlockHash
vtimezone = vcalendar.blocks.get(0);
508
BlockHash
vevent = vcalendar.blocks.get(1);
571
BlockHash
vcalendar = parseIcsContent(att.mContentBytes);
584
BlockHash
vtimezone = vcalendar.blocks.get(0);
589
BlockHash
vevent = vcalendar.blocks.get(1)
[
all
...]
Completed in 671 milliseconds