twitter_cldr 6.11.1 → 6.11.2
Sign up to get free protection for your applications and to get access to all the features.
checksums.yaml
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
---
|
2
2
|
SHA256:
|
3
|
-
metadata.gz:
|
4
|
-
data.tar.gz:
|
3
|
+
metadata.gz: cbd2915afa874b800c57f2d808dfcf03218625b27c23ff6be37bf666cc9f6164
|
4
|
+
data.tar.gz: 32f81597c78d310f3030924001870e38137e7b0c4ab011c496167c2f0f3b8af1
|
5
5
|
SHA512:
|
6
|
-
metadata.gz:
|
7
|
-
data.tar.gz:
|
6
|
+
metadata.gz: df9df519e582bc1bfd6d3030fdb9a507c9e6aad2c3715434de1aa37c1f0ca3645d23945096264954b865b31a5500d13e578273d07d23415eabf382e591bdc583
|
7
|
+
data.tar.gz: 367934c47449765583e8b24778fb5c99b7cc88e215bd51de041899fb87cdf6f406ab156b7255581a69c6edf9bc17f9ebfb1c4be54875977fee1f9cdf88db9278
|
@@ -99,7 +99,7 @@ module TwitterCldr
|
|
99
99
|
# the base value divided by the LCD. Here we check to
|
100
100
|
# see if that's an integer, and if not, how close it is
|
101
101
|
# to being an integer.
|
102
|
-
temp_difference = numerator * BigDecimal
|
102
|
+
temp_difference = numerator * BigDecimal(rules[i].base_value) % least_common_multiple
|
103
103
|
|
104
104
|
# normalize the result of the above calculation: we want
|
105
105
|
# the numerator's distance from the CLOSEST multiple
|
data/lib/twitter_cldr/version.rb
CHANGED
metadata
CHANGED
@@ -1,14 +1,14 @@
|
|
1
1
|
--- !ruby/object:Gem::Specification
|
2
2
|
name: twitter_cldr
|
3
3
|
version: !ruby/object:Gem::Version
|
4
|
-
version: 6.11.
|
4
|
+
version: 6.11.2
|
5
5
|
platform: ruby
|
6
6
|
authors:
|
7
7
|
- Cameron Dutro
|
8
8
|
autorequire:
|
9
9
|
bindir: bin
|
10
10
|
cert_chain: []
|
11
|
-
date: 2022-
|
11
|
+
date: 2022-02-17 00:00:00.000000000 Z
|
12
12
|
dependencies:
|
13
13
|
- !ruby/object:Gem::Dependency
|
14
14
|
name: camertron-eprun
|