This repository has been archived by the owner on Sep 28, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 23
/
Copy pathimports_test.go
195 lines (182 loc) · 5.11 KB
/
imports_test.go
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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
// Copyright 2017 Pilosa Corp.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. 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.
//
// 3. Neither the name of the copyright holder 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.
package pilosa_test
import (
"errors"
"io"
"reflect"
"strings"
"testing"
pilosa "github.com/pilosa/go-pilosa"
)
func TestCSVBitIterator(t *testing.T) {
iterator := pilosa.NewCSVBitIterator(strings.NewReader(`1,10,683793200
5,20,683793300
3,41,683793385`))
bits := []pilosa.Bit{}
for {
bit, err := iterator.NextBit()
if err == io.EOF {
break
}
if err != nil {
t.Fatal(err)
}
bits = append(bits, bit)
}
if len(bits) != 3 {
t.Fatalf("There should be 3 bits")
}
target := []pilosa.Bit{
{RowID: 1, ColumnID: 10, Timestamp: 683793200},
{RowID: 5, ColumnID: 20, Timestamp: 683793300},
{RowID: 3, ColumnID: 41, Timestamp: 683793385},
}
if !reflect.DeepEqual(target, bits) {
t.Fatalf("%v != %v", target, bits)
}
}
func TestCSVBitIteratorWithTimestampFormat(t *testing.T) {
format := "2014-07-16T20:55"
iterator := pilosa.NewCSVBitIteratorWithTimestampFormat(strings.NewReader(`1,10,1991-09-02T09:33
5,20,1991-09-02T09:35
3,41,1991-09-02T09:36`), format)
bits := []pilosa.Bit{}
for {
bit, err := iterator.NextBit()
if err == io.EOF {
break
}
if err != nil {
t.Fatal(err)
}
bits = append(bits, bit)
}
if len(bits) != 3 {
t.Fatalf("There should be 3 bits")
}
target := []pilosa.Bit{
{RowID: 1, ColumnID: 10, Timestamp: 683803980},
{RowID: 5, ColumnID: 20, Timestamp: 683804100},
{RowID: 3, ColumnID: 41, Timestamp: 683804160},
}
if !reflect.DeepEqual(target, bits) {
t.Fatalf("%v != %v", target, bits)
}
}
func TestCSVBitIteratorWithTimestampFormatFail(t *testing.T) {
format := "2014-07-16"
iterator := pilosa.NewCSVBitIteratorWithTimestampFormat(strings.NewReader(`1,10,X`), format)
_, err := iterator.NextBit()
if err == nil {
t.Fatalf("Should have failed")
}
}
func TestCSVValueIterator(t *testing.T) {
iterator := pilosa.NewCSVValueIterator(strings.NewReader(`1,10
5,20
3,41
`))
values := []pilosa.FieldValue{}
for {
value, err := iterator.NextValue()
if err != nil {
break
}
values = append(values, value)
}
if len(values) != 3 {
t.Fatalf("There should be 3 values")
}
target := []pilosa.FieldValue{
{ColumnID: 1, Value: 10},
{ColumnID: 5, Value: 20},
{ColumnID: 3, Value: 41},
}
if !reflect.DeepEqual(target, values) {
t.Fatalf("%v != %v", target, values)
}
}
func TestCSVBitIteratorInvalidInput(t *testing.T) {
invalidInputs := []string{
// less than 2 columns
"155",
// invalid row ID
"a5,155",
// invalid column ID
"155,a5",
// invalid timestamp
"155,255,a5",
}
for _, text := range invalidInputs {
iterator := pilosa.NewCSVBitIterator(strings.NewReader(text))
_, err := iterator.NextBit()
if err == nil {
t.Fatalf("CSVBitIterator input: %s should fail", text)
}
}
}
func TestCSVValueIteratorInvalidInput(t *testing.T) {
invalidInputs := []string{
// less than 2 columns
"155",
// invalid column ID
"a5,155",
// invalid value
"155,a5",
}
for _, text := range invalidInputs {
iterator := pilosa.NewCSVValueIterator(strings.NewReader(text))
_, err := iterator.NextValue()
if err == nil {
t.Fatalf("CSVValueIterator input: %s should fail", text)
}
}
}
func TestCSVBitIteratorError(t *testing.T) {
iterator := pilosa.NewCSVBitIterator(&BrokenReader{})
_, err := iterator.NextBit()
if err == nil {
t.Fatal("CSVBitIterator should fail with error")
}
}
func TestCSVValueIteratorError(t *testing.T) {
iterator := pilosa.NewCSVValueIterator(&BrokenReader{})
_, err := iterator.NextValue()
if err == nil {
t.Fatal("CSVValueIterator should fail with error")
}
}
type BrokenReader struct{}
func (r BrokenReader) Read(p []byte) (n int, err error) {
return 0, errors.New("broken reader")
}