forked from priorknowledge/loom
-
Notifications
You must be signed in to change notification settings - Fork 9
/
differ.hpp
140 lines (117 loc) · 4.59 KB
/
differ.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
// Copyright (c) 2014, Salesforce.com, Inc. All rights reserved.
// Copyright (c) 2015, Google, Inc.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
//
// - Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// - Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// - Neither the name of Salesforce.com nor the names of its contributors
// may be used to endorse or promote products derived from this
// software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
// FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
// COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
// INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
// BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
// OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
// TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
// USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#pragma once
#include <loom/protobuf.hpp>
#include <loom/protobuf_stream.hpp>
#include <loom/product_value.hpp>
namespace loom
{
class Differ
{
public:
Differ (const ValueSchema & schema);
Differ (const ValueSchema & schema, const ProductValue & tare);
void add_rows (const char * rows_in);
const ProductValue & get_tare () const { return small_tare_; }
void set_tare (const ProductValue & tare);
void compress_rows (const char * rows_in, const char * diffs_out) const;
private:
struct BooleanSummary
{
typedef bool Value;
size_t counts[2];
BooleanSummary () : counts{0, 0} {}
void add (Value value) { ++counts[value]; }
Value get_mode () const { return counts[1] > counts[0]; }
size_t get_count (Value value) const { return counts[value]; }
};
struct CountSummary
{
enum { max_count = 16 }; // assume mode lies in [0, max_count)
typedef uint32_t Value;
size_t counts[max_count];
CountSummary () { std::fill(counts, counts + max_count, 0); }
void add (Value value)
{
if (value < max_count) {
++counts[value];
}
}
Value get_mode () const
{
Value value = 0;
for (size_t i = 0; i < max_count; ++i) {
if (counts[i] > counts[value]) {
value = i;
}
}
return value;
}
size_t get_count (Value value) const
{
LOOM_ASSERT_LT(value, max_count);
return counts[value];
}
};
void _make_tare ();
template<class Summaries, class Values>
void _make_tare_type (
ProductValue::Observed & observed,
const Summaries & summaries,
Values & values) const;
void _compress (ProductValue & data) const;
void _compress (ProductValue::Diff & diff) const;
void _abs_to_rel (ProductValue & data, ProductValue::Diff & diff) const;
void _rel_to_abs (ProductValue & data, ProductValue::Diff & diff) const;
void _validate_diff (
const ProductValue & data,
const ProductValue::Diff & diff) const;
void _build_temporaries (ProductValue & value) const;
void _clean_temporaries (ProductValue & value) const;
template<class T>
void _abs_to_rel_type (
const ProductValue & abs,
ProductValue & pos,
ProductValue & neg,
const BlockIterator & block) const;
template<class T>
void _rel_to_abs_type (
ProductValue & abs,
const ProductValue & pos,
const ProductValue & neg,
const BlockIterator & block) const;
const ValueSchema & schema_;
const protobuf::ProductValue blank_;
const protobuf::ProductValue::Observed full_;
size_t row_count_;
std::vector<BooleanSummary> booleans_;
std::vector<CountSummary> counts_;
protobuf::ProductValue small_tare_;
protobuf::ProductValue dense_tare_;
};
} // namespace loom