ruby-mext 0.13.1 → 0.14.0
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/bin/console +1 -1
- data/lib/mext/array/endless_array.rb +91 -0
- data/lib/mext/array/fill.rb +23 -0
- data/lib/mext/array.rb +2 -0
- data/lib/version.rb +1 -1
- metadata +4 -2
checksums.yaml
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
---
|
2
2
|
SHA256:
|
3
|
-
metadata.gz:
|
4
|
-
data.tar.gz:
|
3
|
+
metadata.gz: 8827f153719404c7a58d76841b1035dec8554e0d1352b65a04437d67d53354a4
|
4
|
+
data.tar.gz: d3815f2309de12f1cc4b5b403709ec04c201a7500fcedc76484c048ad38f38da
|
5
5
|
SHA512:
|
6
|
-
metadata.gz:
|
7
|
-
data.tar.gz:
|
6
|
+
metadata.gz: 225682bc6a0c772a7aaa8f7136b9411a34aa39ab550158b6b78b8cc25afe7e4f00b3ad42b861c7eecb804b2360bae7cfb70acae3009933b73087ffa5a23fc9eb
|
7
|
+
data.tar.gz: e992d615c3ae63283e27d2b4187da1d8a2455c703121f89904e944b7158456c4817b529862c85025047fa04e2e54e6c5bfcd0e52ad504081dde6b39d68da150e
|
data/bin/console
CHANGED
@@ -0,0 +1,91 @@
|
|
1
|
+
require 'byebug'
|
2
|
+
|
3
|
+
module Mext
|
4
|
+
|
5
|
+
#
|
6
|
+
# +Mext::EndlessArray+
|
7
|
+
#
|
8
|
+
# an +array+ with an internal index which will chug out the +next+
|
9
|
+
# or the previous value in an endless fashion (i.e. +mod'ding+
|
10
|
+
# the current index)
|
11
|
+
#
|
12
|
+
class EndlessArray < Array
|
13
|
+
|
14
|
+
attr_reader :cur, :restart_value
|
15
|
+
|
16
|
+
#
|
17
|
+
# +Mext::EndlessArray.new(me = [], rv = 0)+
|
18
|
+
#
|
19
|
+
# create an endless array with a regular array copy.
|
20
|
+
# Another optional argument is the +restart_value+
|
21
|
+
# (which defaults to 0)
|
22
|
+
#
|
23
|
+
def initialize(me = [], rv = 0)
|
24
|
+
self.replace(me)
|
25
|
+
@cur = @restart_value = rv
|
26
|
+
end
|
27
|
+
|
28
|
+
#
|
29
|
+
# +next(step = 1)+
|
30
|
+
#
|
31
|
+
# bumps the current index forward of a +step+ value and returns
|
32
|
+
# the current element of +array+
|
33
|
+
#
|
34
|
+
def next(step = 1)
|
35
|
+
res = self.current
|
36
|
+
@cur += step
|
37
|
+
@cur = [self.cur % self.size, self.restart_value].max
|
38
|
+
res
|
39
|
+
end
|
40
|
+
|
41
|
+
#
|
42
|
+
# +previous(step = 1)+
|
43
|
+
#
|
44
|
+
# bumps the index backwards and returns the
|
45
|
+
# previous element of the +array+
|
46
|
+
#
|
47
|
+
def previous(step = 1)
|
48
|
+
res = self.current
|
49
|
+
@cur -= step
|
50
|
+
cur_check = @cur - self.restart_value
|
51
|
+
@cur = cur_check < 0 ? (cur_check % self.size) : @cur
|
52
|
+
res
|
53
|
+
end
|
54
|
+
|
55
|
+
class RestartValueTooLarge < StandardError; end
|
56
|
+
#
|
57
|
+
# +restart_value=(v)+
|
58
|
+
#
|
59
|
+
# sets the +restart_value+ to +v+. Raises an exception if +v+ is larger
|
60
|
+
# than +self.size - 1+. When set, it changes the current index but only
|
61
|
+
# it is below the +restart_value+
|
62
|
+
#
|
63
|
+
def restart_value=(v)
|
64
|
+
raise RestartValueTooLarge if v >= self.size
|
65
|
+
@restart_value = v
|
66
|
+
@cur = [@cur, @restart_value].max
|
67
|
+
end
|
68
|
+
|
69
|
+
#
|
70
|
+
# +current+
|
71
|
+
#
|
72
|
+
# returns the value stored in the current location
|
73
|
+
#
|
74
|
+
def current
|
75
|
+
self[self.cur]
|
76
|
+
end
|
77
|
+
|
78
|
+
#
|
79
|
+
# +reset+
|
80
|
+
#
|
81
|
+
# reset the +current+ pointer to the +restart_value+
|
82
|
+
# and returns whatever happens to be in it.
|
83
|
+
#
|
84
|
+
def reset
|
85
|
+
@cur = self.restart_value
|
86
|
+
self.current
|
87
|
+
end
|
88
|
+
|
89
|
+
end
|
90
|
+
|
91
|
+
end
|
@@ -0,0 +1,23 @@
|
|
1
|
+
class Array
|
2
|
+
|
3
|
+
class << self
|
4
|
+
|
5
|
+
#
|
6
|
+
# +fill_float(end_value, start_value = 0.0, step = 1.0)+
|
7
|
+
#
|
8
|
+
# fill a blank newly created array with +Float+ numbers which will range
|
9
|
+
# from +start_value+ to +end_value+ in steps of +step+
|
10
|
+
#
|
11
|
+
MINIMUM_STEP = 1e-32
|
12
|
+
|
13
|
+
def fill_float(end_value, start_value = 0.0, step = 1.0)
|
14
|
+
raise ArgumentError.new("step too small") unless step.abs > MINIMUM_STEP
|
15
|
+
res = new
|
16
|
+
ev = end_value - step
|
17
|
+
start_value.step(ev, step).each { |f| res << f }
|
18
|
+
res
|
19
|
+
end
|
20
|
+
|
21
|
+
end
|
22
|
+
|
23
|
+
end
|
data/lib/mext/array.rb
CHANGED
data/lib/version.rb
CHANGED
metadata
CHANGED
@@ -1,14 +1,14 @@
|
|
1
1
|
--- !ruby/object:Gem::Specification
|
2
2
|
name: ruby-mext
|
3
3
|
version: !ruby/object:Gem::Version
|
4
|
-
version: 0.
|
4
|
+
version: 0.14.0
|
5
5
|
platform: ruby
|
6
6
|
authors:
|
7
7
|
- Nicola Bernardini
|
8
8
|
autorequire:
|
9
9
|
bindir: exe
|
10
10
|
cert_chain: []
|
11
|
-
date: 2019-
|
11
|
+
date: 2019-06-10 00:00:00.000000000 Z
|
12
12
|
dependencies:
|
13
13
|
- !ruby/object:Gem::Dependency
|
14
14
|
name: bundler
|
@@ -117,6 +117,8 @@ files:
|
|
117
117
|
- lib/mext/array.rb
|
118
118
|
- lib/mext/array/choose.rb
|
119
119
|
- lib/mext/array/dotop.rb
|
120
|
+
- lib/mext/array/endless_array.rb
|
121
|
+
- lib/mext/array/fill.rb
|
120
122
|
- lib/mext/array/scalarop.rb
|
121
123
|
- lib/mext/array/vectorize.rb
|
122
124
|
- lib/mext/exceptions.rb
|