rfpset 0.0.1 → 0.0.2
Sign up to get free protection for your applications and to get access to all the features.
- data/lib/rfpset.rb +1 -1
- data/lib/rfpset/version.rb +1 -1
- data/test/test_fpset.rb +3 -3
- metadata +2 -2
data/lib/rfpset.rb
CHANGED
@@ -52,7 +52,7 @@ module FPSet
|
|
52
52
|
def from_file(filename)
|
53
53
|
result = FPSetInternal.slurp_array(filename)
|
54
54
|
raise "does the file #{filename} exist?" if result == -1
|
55
|
-
|
55
|
+
result.map { |s| Marshal.load(s) }
|
56
56
|
end
|
57
57
|
module_function :from_file
|
58
58
|
|
data/lib/rfpset/version.rb
CHANGED
data/test/test_fpset.rb
CHANGED
@@ -29,16 +29,16 @@ class FPSetTest < Test::Unit::TestCase
|
|
29
29
|
FPSet.to_file(Array(1..5).concat(Array(1..5)), test1)
|
30
30
|
FPSet.to_file(3..6, test2)
|
31
31
|
assert_equal 3, FPSet.intersect_files([test1, test2]).size
|
32
|
-
assert_equal (1..5).to_set, FPSet.from_file(test1)
|
32
|
+
assert_equal (1..5).to_set, Set.new(FPSet.from_file(test1))
|
33
33
|
assert_equal Array(1..5), FPSet.intersect_files([test1])
|
34
34
|
|
35
35
|
# are more interesting types preserved?
|
36
36
|
test3_data = 5.times.collect { |i| [i.to_s] }
|
37
37
|
test3 = "test3.dat"
|
38
38
|
FPSet.to_file(test3_data, test3)
|
39
|
-
assert_equal test3_data.to_set, FPSet.from_file(test3)
|
39
|
+
assert_equal test3_data.to_set, Set.new(FPSet.from_file(test3))
|
40
40
|
FPSet.to_file!(Array.new(test3_data), test3)
|
41
|
-
assert_equal test3_data.to_set, FPSet.from_file(test3)
|
41
|
+
assert_equal test3_data.to_set, Set.new(FPSet.from_file(test3))
|
42
42
|
end
|
43
43
|
end
|
44
44
|
|
metadata
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
--- !ruby/object:Gem::Specification
|
2
2
|
name: rfpset
|
3
3
|
version: !ruby/object:Gem::Version
|
4
|
-
version: 0.0.
|
4
|
+
version: 0.0.2
|
5
5
|
prerelease:
|
6
6
|
platform: ruby
|
7
7
|
authors:
|
@@ -9,7 +9,7 @@ authors:
|
|
9
9
|
autorequire:
|
10
10
|
bindir: bin
|
11
11
|
cert_chain: []
|
12
|
-
date: 2012-07-
|
12
|
+
date: 2012-07-29 00:00:00.000000000Z
|
13
13
|
dependencies: []
|
14
14
|
description: Fast, persistent sets supporting efficient intersections of many very
|
15
15
|
large sets.
|