sequitur 0.1.11 → 0.1.12

Sign up to get free protection for your applications and to get access to all the features.
checksums.yaml CHANGED
@@ -1,15 +1,15 @@
1
1
  ---
2
2
  !binary "U0hBMQ==":
3
3
  metadata.gz: !binary |-
4
- YjAyNWQ2ZDE4MmE2NGU3MTVjZTMxNDc2YjI4ZmE3NTBlMWRlZWM0MQ==
4
+ ZGY5ODk3ZDZiNDE1MjljNzg0ODBiZTY4YjJiNGZlMTc0NTljMWJiOQ==
5
5
  data.tar.gz: !binary |-
6
- NGMzZDRiYjNiYzAwNjE0MzFhOGI0YWQyNjU4YmRjMzNkMDY1ZGEzOA==
6
+ M2M1NWNjNGY1NTIzMjVmYjFiNDBmZGNmOWJhYzhkY2JiZGM4ZDA1Nw==
7
7
  !binary "U0hBNTEy":
8
8
  metadata.gz: !binary |-
9
- NjBhMGRlYWIyNmI1MWJmNmE0NDc5MzU4NTc4MjI1ZDVhYjIwZDA2NjAyYzdj
10
- NGMzYmU4NmYzNDQ2NTI4MWJhYTQxYTBkYTU1NGVjODcyNjIwNjQxM2Q5ZTUz
11
- NGU3YWQzODk2ODA5OWFkZDY0ZThkNjhmMzMzNTdhMTI2ZmZiYmM=
9
+ NWIwMWVkNjFlNGU5ZDNjYzEyMzEzMzVhNDcyODAxNThjNTE1MTlkNjBiYzg3
10
+ YWVkZDFlYzg1OGJlZGZjNTYwYjg3ZGU2NGFkYmU3NDFjYTMwM2JhNjYxMDRm
11
+ NmMxNTNlMzkxYmI5NWU5OGNlYzZmYWE2NTYyNDAyNmU3MTNiYjk=
12
12
  data.tar.gz: !binary |-
13
- NDA2OTE2YTAxYmZmODg1NTU3YWFmNTlmNWIwNzU2NjNlMTEzZmE2NGFiMDkw
14
- OTYxMTkzMmNmZDJkZGJiZmE2ZDljNzdjY2EzZDk2YmYyMmM4YWJmNDBhNWI2
15
- YWJjYWE1NWYwZmE3Y2Q0ZDMzMGYyMjdhMWQzZDI5NzI1MDgyMzc=
13
+ ODIwNDIxOWExZWU3NGM0OTEzZjA0MTgzYjg5ZDZiNGNmMTE3OTBjMWJiYmY2
14
+ MjA5Zjg1Y2IwNWYyYjE4NWY3N2YwNzZjNDlkY2FlNjMzYTRmMGY5ZTM1ZmI0
15
+ N2QyMzNlYjM4YTg0NTljNTE1NWE1NWE3NTJmNjhkYTU1NzMwOTc=
data/CHANGELOG.md CHANGED
@@ -1,3 +1,7 @@
1
+ ### 0.1.12 / 2014-10-07
2
+ * [CHANGE] File `README.md`: Fixed documentation inaccuracy.
3
+
4
+
1
5
  ### 0.1.11 / 2014-10-07
2
6
  * [CHANGE] File `README.md`: Added an example showing that Sequitur can work on a sequence of integers.
3
7
  * [NEW] Folder `examples` Added a few code sample.
data/README.md CHANGED
@@ -205,14 +205,6 @@ character tokens. This is simply not true.
205
205
  This implementation is flexible enough to cope with other kinds of input values.
206
206
  The next example shows how integer values can be correctly processed by Sequitur.
207
207
  Assume that the input is the array of Fixnums *[1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5]*.
208
- Then Sequitur algorithm will generate the rule set:
209
- ```
210
- start : P1 P2 P3 P3 e.
211
- P1 : a b.
212
- P2 : P1 c.
213
- P3 : P2 d.
214
- ```
215
-
216
208
 
217
209
  ```ruby
218
210
  require 'sequitur' # Load the Sequitur library
@@ -3,7 +3,7 @@
3
3
 
4
4
  module Sequitur # Module used as a namespace
5
5
  # The version number of the gem.
6
- Version = '0.1.11'
6
+ Version = '0.1.12'
7
7
 
8
8
  # Brief description of the gem.
9
9
  Description = 'Ruby implementation of the Sequitur algorithm'
metadata CHANGED
@@ -1,7 +1,7 @@
1
1
  --- !ruby/object:Gem::Specification
2
2
  name: sequitur
3
3
  version: !ruby/object:Gem::Version
4
- version: 0.1.11
4
+ version: 0.1.12
5
5
  platform: ruby
6
6
  authors:
7
7
  - Dimitri Geshef