laziest 0.0.1 → 0.0.2
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/laziest.gemspec +2 -3
- data/lib/laziest/version.rb +1 -1
- metadata +3 -18
checksums.yaml
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
---
|
2
2
|
SHA1:
|
3
|
-
metadata.gz:
|
4
|
-
data.tar.gz:
|
3
|
+
metadata.gz: b4a4d2f714ad238182cdef69bb781e42569b6087
|
4
|
+
data.tar.gz: 385fbba9523db93aa2e1576f7e006f61af56536b
|
5
5
|
SHA512:
|
6
|
-
metadata.gz:
|
7
|
-
data.tar.gz:
|
6
|
+
metadata.gz: f2df922f70b7a1f4235760101af0f8a72ebd9090c39a1b1c0395dff224569d7e21915641040d4774557029923a97a1ba19253dbdb57477dce6124abe6d2f6033
|
7
|
+
data.tar.gz: c552bdf1b44d6e83d6aa71d74ea4c4187d3344fcfa0e1d57428389515bd91fdf6ea75db69ba6a5ca4ac4e141466ae4057c65fe596f3f280c2910dea88d0db89e
|
data/laziest.gemspec
CHANGED
@@ -11,8 +11,8 @@ Gem::Specification.new do |spec|
|
|
11
11
|
spec.description = 'The laziest possible enumerables and enumerators'
|
12
12
|
spec.summary = <<-END
|
13
13
|
When there's just no O(1) way to compute something, this gem provides
|
14
|
-
both promises (lazy evaluation) and partial evaluation
|
15
|
-
|
14
|
+
both promises (lazy evaluation) and partial evaluation.
|
15
|
+
For example, (foo.lazy.count > 5) will
|
16
16
|
invoke the iterator at most six times.
|
17
17
|
END
|
18
18
|
spec.homepage = ''
|
@@ -27,5 +27,4 @@ Gem::Specification.new do |spec|
|
|
27
27
|
spec.add_development_dependency "rake"
|
28
28
|
|
29
29
|
spec.add_dependency 'promise'
|
30
|
-
spec.add_dependency 'soft_reference'
|
31
30
|
end
|
data/lib/laziest/version.rb
CHANGED
metadata
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
--- !ruby/object:Gem::Specification
|
2
2
|
name: laziest
|
3
3
|
version: !ruby/object:Gem::Version
|
4
|
-
version: 0.0.
|
4
|
+
version: 0.0.2
|
5
5
|
platform: ruby
|
6
6
|
authors:
|
7
7
|
- David Masover
|
@@ -52,20 +52,6 @@ dependencies:
|
|
52
52
|
- - '>='
|
53
53
|
- !ruby/object:Gem::Version
|
54
54
|
version: '0'
|
55
|
-
- !ruby/object:Gem::Dependency
|
56
|
-
name: soft_reference
|
57
|
-
requirement: !ruby/object:Gem::Requirement
|
58
|
-
requirements:
|
59
|
-
- - '>='
|
60
|
-
- !ruby/object:Gem::Version
|
61
|
-
version: '0'
|
62
|
-
type: :runtime
|
63
|
-
prerelease: false
|
64
|
-
version_requirements: !ruby/object:Gem::Requirement
|
65
|
-
requirements:
|
66
|
-
- - '>='
|
67
|
-
- !ruby/object:Gem::Version
|
68
|
-
version: '0'
|
69
55
|
description: The laziest possible enumerables and enumerators
|
70
56
|
email:
|
71
57
|
- masover@iastate.edu
|
@@ -111,7 +97,6 @@ rubygems_version: 2.0.3
|
|
111
97
|
signing_key:
|
112
98
|
specification_version: 4
|
113
99
|
summary: When there's just no O(1) way to compute something, this gem provides both
|
114
|
-
promises (lazy evaluation) and partial evaluation
|
115
|
-
|
116
|
-
six times.
|
100
|
+
promises (lazy evaluation) and partial evaluation. For example, (foo.lazy.count
|
101
|
+
> 5) will invoke the iterator at most six times.
|
117
102
|
test_files: []
|