alf-shell 0.16.3 → 0.16.4

data/CHANGELOG.md

@@ -1,3 +1,7 @@
+# 0.16.4 - 2014-09-12
+
+* Fix missing .txt files for help to work properly when `man` is unavailable.
+
 # 0.16.3 - 2014-07-25
 
 * No change in this submodule.

data/Gemfile.lock

@@ -1,15 +1,15 @@
 PATH
   remote: .
   specs:
-    alf-shell (0.16.3)
-      alf-core (= 0.16.3)
+    alf-shell (0.16.4)
+      alf-core (~> 0.16)
       highline (~> 1.6)
       quickl (~> 0.4.3)
 
 PATH
   remote: ../alf-core
   specs:
-    alf-core (0.16.3)
+    alf-core (0.17.0)
       domain (~> 1.0)
       myrrha (~> 3.0)
       path (~> 1.3)
@@ -18,8 +18,8 @@ PATH
 PATH
   remote: ../alf-doc
   specs:
-    alf-doc (0.16.3)
-      alf-core (= 0.16.3)
+    alf-doc (0.17.0)
+      alf-core (= 0.17.0)
 
 GEM
   remote: http://rubygems.org/
@@ -27,7 +27,7 @@ GEM
     diff-lcs (1.2.5)
     domain (1.0.0)
     highline (1.6.21)
-    myrrha (3.0.0)
+    myrrha (3.1.0)
       domain (~> 1.0)
     path (1.3.3)
     quickl (0.4.3)

data/doc/man/alf-explain.man

@@ -19,4 +19,4 @@ engines, as well as involved SQL queries.
 .RE
 .SH Example
 .PP
-\fB\fCalf\fR \fB\fC\-\-examples\fR explain "restrict(suppliers, city: 'London')"
+\fB\fCalf\fR \fB\fC--examples\fR explain "restrict(suppliers, city: 'London')"

data/doc/man/alf-metadata.man

@@ -10,4 +10,4 @@ This command prints some metadata (e.g. heading, keys, etc.) about the
 expression passed as first argument.
 .SH Example
 .PP
-\fB\fCalf\fR \fB\fC\-\-examples\fR metadata "restrict(suppliers, city: 'London')"
+\fB\fCalf\fR \fB\fC--examples\fR metadata "restrict(suppliers, city: 'London')"

data/doc/man/alf-repl.man

@@ -3,11 +3,11 @@
 Launches Alf's Read\-Eval\-Print\-Loop (REPL) web application.
 .SH Synopsis
 .PP
-\fB\fCalf\fR [\fB\fC\-\-db=...\fR] repl
+\fB\fCalf\fR [\fB\fC--db=...\fR] repl
 .SH Description
 .PP
 This command launches the REPL in the current data context defined by the
-\fB\fC\&.alfrc\fR file and common alf options (e.g. \fB\fC\-\-db\fR).
+\fB\fC.alfrc\fR file and common alf options (e.g. \fB\fC--db\fR).
 .SH Example
 .PP
-\fB\fCalf\fR \fB\fC\-\-db=postgres://...\fR repl
+\fB\fCalf\fR \fB\fC--db=postgres://...\fR repl

data/doc/man/alf-show.man

@@ -3,7 +3,7 @@
 Evaluates a query and shows the result.
 .SH Synopsis
 .PP
-\fB\fCalf\fR [\fB\fC\-\-csv\fR|\fB\fC\-\-json\fR\&...] show \fIQUERY\fP \-\- [\fIORDERING\fP]
+\fB\fCalf\fR [\fB\fC--csv\fR|\fB\fC--json\fR\&...] show \fIQUERY\fP \-\- [\fIORDERING\fP]
 .SH Description
 .PP
 Take a query argument and execute it against the current database (according
@@ -13,4 +13,4 @@ output. The format (e.g. json) may be specified through \fB\fCalf\fR main option
 When an ordering is specified, tuples are rendered in the order specified.
 .SH Example
 .PP
-\fB\fCalf\fR \fB\fC\-\-examples\fR show "restrict(suppliers, city: 'London')" \-\- name DESC
+\fB\fCalf\fR \fB\fC--examples\fR show "restrict(suppliers, city: 'London')" \-\- name DESC

data/doc/man/alf.man

@@ -3,7 +3,7 @@
 Relational algebra at your fingertips
 .SH Synopsis
 .PP
-\fB\fCalf\fR [\fB\fC\-\-version\fR] [\fB\fC\-\-help\fR]
+\fB\fCalf\fR [\fB\fC--version\fR] [\fB\fC--help\fR]
 .PP
 \fB\fCalf\fR \fIFILE.alf\fP
 .PP
@@ -14,49 +14,49 @@ Relational algebra at your fingertips
 \fB\fCalf\fR help \fIOPERATOR\fP
 .SH Options
 .TP
-\fB\fC\-\-rash\fR
+\fB\fC--rash\fR
     Render output as ruby hashes
 .TP
-\fB\fC\-\-text\fR
+\fB\fC--text\fR
     Render output as a text table
 .TP
-\fB\fC\-\-yaml\fR
+\fB\fC--yaml\fR
     Render output in YAML
 .TP
-\fB\fC\-\-json\fR
+\fB\fC--json\fR
     Render output in JSON
 .TP
-\fB\fC\-\-csv\fR
+\fB\fC--csv\fR
     Render output in CSV
 .TP
-\fB\fC\-\-examples\fR
+\fB\fC--examples\fR
     Use the suppliers and parts example database
 .TP
-\fB\fC\-\-db=DB\fR
+\fB\fC--db=DB\fR
     Set the database (adapter) to use. Recognized values can be
     folders with recognized files, or an URL to a SQL database
     (e.g. postgres://user:pass@host/database)
 .TP
-\fB\fC\-\-stdin=READER\fR
+\fB\fC--stdin=READER\fR
     Specify the kind of reader when reading on standard input
     (i.e. rash, csv, json, ruby, or yaml)
 .TP
-\fB\fC\-Idirectory\fR
+\fB\fC-Idirectory\fR
     Specify $LOAD_PATH directory (may be used more than once)
 .TP
-\fB\fC\-rlibrary\fR
+\fB\fC-rlibrary\fR
     Require the specified ruby library, before executing alf
 .TP
-\fB\fC\-\-ff=FORMAT\fR
+\fB\fC--ff=FORMAT\fR
     Specify the floating point format
 .TP
-\fB\fC\-\-[no\-]pretty\fR
+\fB\fC--[no-]pretty\fR
     Enable/disable pretty print best effort
 .TP
-\fB\fC\-h\fR, \fB\fC\-\-help\fR
+\fB\fC-h\fR, \fB\fC--help\fR
     Show this help
 .TP
-\fB\fC\-v\fR, \fB\fC\-\-version\fR
+\fB\fC-v\fR, \fB\fC--version\fR
     Show version and copyright
 .SH Commands
 .TP

data/doc/man/allbut.man

@@ -5,7 +5,7 @@ Projects a subset of attributes away.
 .PP
 .RS
 .nf
-allbut(operand: Relation, attributes: AttrList) \-> Relation
+allbut(operand: Relation, attributes: AttrList) -> Relation
 .fi
 .RE
 .SH Examples

data/doc/man/among.man

@@ -5,7 +5,7 @@ Among a set of values
 .PP
 .RS
 .nf
-among(val: Alpha|AttrName, vals: Set<Alpha>) \-> Predicate
+among(val: Alpha|AttrName, vals: Set<Alpha>) -> Predicate
 .fi
 .RE
 .SH Examples

data/doc/man/avg.man

@@ -5,7 +5,7 @@ Average
 .PP
 .RS
 .nf
-avg(expr: AttrName|(Tuple\->Numeric)) \-> Aggregator
+avg(expr: AttrName|(Tuple->Numeric)) -> Aggregator
 .fi
 .RE
 .SH Examples
@@ -24,7 +24,7 @@ avg{|t| t.qty * t.price }
 .PP
 .RS
 .nf
-avg(\->(t){ t.qty * t.price })
+avg(->(t){ t.qty * t.price })
 .fi
 .RE
 .SH Description

data/doc/man/between.man

@@ -5,7 +5,7 @@ Between (inclusive)
 .PP
 .RS
 .nf
-between(val: Alpha|AttrName, min: Alpha|AttrName, max: Alpha|AttrName) \-> Predicate
+between(val: Alpha|AttrName, min: Alpha|AttrName, max: Alpha|AttrName) -> Predicate
 .fi
 .RE
 .SH Examples

data/doc/man/concat.man

@@ -5,7 +5,7 @@ String concatenation
 .PP
 .RS
 .nf
-concat(expr: AttrName|(Tuple\->Numeric)) \-> Aggregator
+concat(expr: AttrName|(Tuple->Numeric)) -> Aggregator
 .fi
 .RE
 .SH Examples
@@ -30,7 +30,7 @@ concat(between: ', '){|t| t.name }
 .PP
 .RS
 .nf
-concat(\->(t){ t.name.upcase }, between: ', ')
+concat(->(t){ t.name.upcase }, between: ', ')
 .fi
 .RE
 .SH Description

data/doc/man/contradiction.man

@@ -5,7 +5,7 @@ FALSE
 .PP
 .RS
 .nf
-contradiction() \-> Predicate
+contradiction() -> Predicate
 .fi
 .RE
 .SH Examples
@@ -23,4 +23,4 @@ contradiction
 .RE
 .SH Description
 .PP
-This predicate always return false. It is equivalent to \fB\fC\->(t){ false }\fR\&.
+This predicate always return false. It is equivalent to \fB\fC->(t){ false }\fR\&.

data/doc/man/count.man

@@ -5,7 +5,7 @@ Count
 .PP
 .RS
 .nf
-count() \-> Aggregator
+count() -> Aggregator
 .fi
 .RE
 .SH Examples

data/doc/man/eq.man

@@ -5,7 +5,7 @@ Equals to
 .PP
 .RS
 .nf
-eq(left: Alpha|AttrName, right: Alpha|AttrName) \-> Predicate
+eq(left: Alpha|AttrName, right: Alpha|AttrName) -> Predicate
 .fi
 .RE
 .SH Examples
@@ -26,4 +26,4 @@ eq(:supplier_city, :part_city)
 This predicates checks whether two values are equal.
 .SH Implementation notes
 .PP
-This predicate is equivalent to \fB\fC\->(t){ _left_ == _right_ }\fR\&.
+This predicate is equivalent to \fB\fC->(t){ _left_ == _right_ }\fR\&.

data/doc/man/extend.man

@@ -5,7 +5,7 @@ Extends input tuples with derived/computed attributes
 .PP
 .RS
 .nf
-extend(operand: Relation, ext: TupleComputation) \-> Relation
+extend(operand: Relation, ext: TupleComputation) -> Relation
 .fi
 .RE
 .SH Examples
@@ -13,8 +13,8 @@ extend(operand: Relation, ext: TupleComputation) \-> Relation
 .RS
 .nf
 extend(suppliers,
-  big:   \->(t){ t.name.upcase },
-  small: \->(t){ t.name.downcase })
+  big:   ->(t){ t.name.upcase },
+  small: ->(t){ t.name.downcase })
 .fi
 .RE
 .SH Description

data/doc/man/frame.man

@@ -5,7 +5,7 @@ Aka limit/offset
 .PP
 .RS
 .nf
-frame(operand: Relation, order: Ordering, offset: Integer, limit: Integer) \-> Relation
+frame(operand: Relation, order: Ordering, offset: Integer, limit: Integer) -> Relation
 .fi
 .RE
 .SH Examples

data/doc/man/group.man

@@ -5,7 +5,7 @@ Relation\-valued attribute
 .PP
 .RS
 .nf
-group(operand: Relation, attributes: AttrList, as: AttrName) \-> Relation
+group(operand: Relation, attributes: AttrList, as: AttrName) -> Relation
 .fi
 .RE
 .SH Examples
@@ -33,7 +33,7 @@ This operator could be formally defined as the following shortcut:
 def group(operand, attributes, as)
   extend(
     allbut(operand, attributes),
-    as: \->(t){ project(matching(operand, 
+    as: ->(t){ project(matching(operand, 
 .BR Relation (t)), 
 attributes) })
 end

data/doc/man/gt.man

@@ -5,7 +5,7 @@ Greater than
 .PP
 .RS
 .nf
-gt(left: Alpha|AttrName, right: Alpha|AttrName) \-> Predicate
+gt(left: Alpha|AttrName, right: Alpha|AttrName) -> Predicate
 .fi
 .RE
 .SH Examples
@@ -27,4 +27,4 @@ This predicates checks whether a value (\fB\fCleft\fR) is greater than another
 one (\fB\fCright\fR).
 .SH Implementation notes
 .PP
-This predicate is equivalent to \fB\fC\->(t){ _left_ > _right_ }\fR\&.
+This predicate is equivalent to \fB\fC->(t){ _left_ > _right_ }\fR\&.

data/doc/man/gte.man

@@ -5,7 +5,7 @@ Greater than or equal to
 .PP
 .RS
 .nf
-gte(left: Alpha|AttrName, right: Alpha|AttrName) \-> Predicate
+gte(left: Alpha|AttrName, right: Alpha|AttrName) -> Predicate
 .fi
 .RE
 .SH Examples
@@ -27,4 +27,4 @@ This predicates checks whether a value (\fB\fCleft\fR) is greater than or equal
 to another one (\fB\fCright\fR).
 .SH Implementation notes
 .PP
-This predicate is equivalent to \fB\fC\->(t){ _left_ >= _right_ }\fR\&.
+This predicate is equivalent to \fB\fC->(t){ _left_ >= _right_ }\fR\&.

data/doc/man/image.man

@@ -6,7 +6,7 @@ tuple in the right relation.
 .PP
 .RS
 .nf
-image(left: Relation, right: Relation, as: AttrName) \-> Relation
+image(left: Relation, right: Relation, as: AttrName) -> Relation
 .fi
 .RE
 .SH Examples
@@ -30,7 +30,7 @@ expression:
 .RS
 .nf
 def image(left, right, as)
-  extend(left, as => \->(t){
+  extend(left, as => ->(t){
     allbut(
       matching(right, 
 .BR Relation (t)),

data/doc/man/intersect.man

@@ -5,7 +5,7 @@ Logical AND
 .PP
 .RS
 .nf
-intersect(left: Relation, right: Relation) \-> Relation
+intersect(left: Relation, right: Relation) -> Relation
 .fi
 .RE
 .SH Examples

data/doc/man/join.man

@@ -5,7 +5,7 @@ Natural join
 .PP
 .RS
 .nf
-join(left: Relation, right: Relation) \-> Relation
+join(left: Relation, right: Relation) -> Relation
 .fi
 .RE
 .SH Examples
@@ -75,7 +75,7 @@ Alternatively, shortcuts can be considered. A (advanced) example below:
 # before joining.
 def join_on(left, right, wish)
   commons = left.attr_list & right.attr_list
-  join(left, allbut(right, commons \- wish))
+  join(left, allbut(right, commons - wish))
 end
 # observe here how part names have been discarded to avoid joining them
 # with supplier names (empty result guaranteed)

data/doc/man/lt.man

@@ -5,7 +5,7 @@ Less than
 .PP
 .RS
 .nf
-lt(left: Alpha|AttrName, right: Alpha|AttrName) \-> Predicate
+lt(left: Alpha|AttrName, right: Alpha|AttrName) -> Predicate
 .fi
 .RE
 .SH Examples
@@ -27,4 +27,4 @@ This predicates checks whether a value (\fB\fCleft\fR) is less than another one
 (\fB\fCright\fR).
 .SH Implementation notes
 .PP
-This predicate is equivalent to \fB\fC\->(t){ _left_ < _right_ }\fR\&.
+This predicate is equivalent to \fB\fC->(t){ _left_ < _right_ }\fR\&.

data/doc/man/lte.man

@@ -5,7 +5,7 @@ Less than or equal to
 .PP
 .RS
 .nf
-lte(left: Alpha|AttrName, right: Alpha|AttrName) \-> Predicate
+lte(left: Alpha|AttrName, right: Alpha|AttrName) -> Predicate
 .fi
 .RE
 .SH Examples
@@ -27,4 +27,4 @@ This predicates checks whether a value (\fB\fCleft\fR) is less than or equal to
 another one (\fB\fCright\fR).
 .SH Implementation notes
 .PP
-This predicate is equivalent to \fB\fC\->(t){ _left_ <= _right_ }\fR\&.
+This predicate is equivalent to \fB\fC->(t){ _left_ <= _right_ }\fR\&.

data/doc/man/matching.man

@@ -5,7 +5,7 @@ Aka 'where exists'
 .PP
 .RS
 .nf
-matching(left: Relation, right: Relation) \-> Relation
+matching(left: Relation, right: Relation) -> Relation
 .fi
 .RE
 .SH Examples

data/doc/man/max.man

@@ -5,7 +5,7 @@ Maximal value
 .PP
 .RS
 .nf
-max(expr: AttrName|(Tuple\->Numeric)) \-> Aggregator
+max(expr: AttrName|(Tuple->Numeric)) -> Aggregator
 .fi
 .RE
 .SH Examples
@@ -24,7 +24,7 @@ max{|t| t.qty * t.price }
 .PP
 .RS
 .nf
-max(\->(t){ t.qty * t.price })
+max(->(t){ t.qty * t.price })
 .fi
 .RE
 .SH Description

data/doc/man/min.man

@@ -5,7 +5,7 @@ Minimal value
 .PP
 .RS
 .nf
-min(expr: AttrName|(Tuple\->Numeric)) \-> Aggregator
+min(expr: AttrName|(Tuple->Numeric)) -> Aggregator
 .fi
 .RE
 .SH Examples
@@ -24,7 +24,7 @@ min{|t| t.qty * t.price }
 .PP
 .RS
 .nf
-min(\->(t){ t.qty * t.price })
+min(->(t){ t.qty * t.price })
 .fi
 .RE
 .SH Description

data/doc/man/minus.man

@@ -5,7 +5,7 @@ Logical AND NOT
 .PP
 .RS
 .nf
-minus(left: Relation, right: Relation) \-> Relation
+minus(left: Relation, right: Relation) -> Relation
 .fi
 .RE
 .SH Examples

data/doc/man/native.man

@@ -5,14 +5,14 @@ User\-defined tuple predicate
 .PP
 .RS
 .nf
-native(predicate: (Tuple \-> Boolean)) \-> Predicate
+native(predicate: (Tuple -> Boolean)) -> Predicate
 .fi
 .RE
 .SH Examples
 .PP
 .RS
 .nf
-\->(t){ t.city == 'London' }
+->(t){ t.city == 'London' }
 .fi
 .RE
 .SH Description

data/doc/man/neq.man

@@ -5,7 +5,7 @@ Not equal to
 .PP
 .RS
 .nf
-neq(left: Alpha|AttrName, right: Alpha|AttrName) \-> Predicate
+neq(left: Alpha|AttrName, right: Alpha|AttrName) -> Predicate
 .fi
 .RE
 .SH Examples
@@ -26,4 +26,4 @@ neq(:supplier_city, :part_city)
 This predicates checks whether two values are different.
 .SH Implementation notes
 .PP
-This predicate is equivalent to \fB\fC\->(t){ _left_ != _right_ }\fR\&.
+This predicate is equivalent to \fB\fC->(t){ _left_ != _right_ }\fR\&.

data/doc/man/not_matching.man

@@ -5,7 +5,7 @@ Aka 'where not exists'
 .PP
 .RS
 .nf
-not_matching(left: Relation, right: Relation) \-> Relation
+not_matching(left: Relation, right: Relation) -> Relation
 .fi
 .RE
 .SH Examples

data/doc/man/page.man

@@ -5,7 +5,7 @@ Pagination
 .PP
 .RS
 .nf
-page(operand: Relation, ordering: Ordering, nth: Integer) \-> Relation
+page(operand: Relation, ordering: Ordering, nth: Integer) -> Relation
 .fi
 .RE
 .SH Examples
@@ -18,7 +18,7 @@ page(suppliers, [:status, :sid], 1, page_size: 3)
 .PP
 .RS
 .nf
-page(suppliers, [:status, :sid], \-1, page_size: 3)
+page(suppliers, [:status, :sid], -1, page_size: 3)
 .fi
 .RE
 .SH Description
@@ -28,7 +28,7 @@ belonging to the \fB\fCnth\fR page (starting at 1). When \fB\fCnth\fR is negativ
 tuples that belong to the \fB\fCnth\fR page from the end (e.g., \-1 is last page).
 .PP
 Formally, the page is defined by those tuples whose ranking according to
-\fB\fCorder\fR is such that \fB\fC(nth\-1)*page_size <= rank < nth*page_size\fR\&. In other
+\fB\fCorder\fR is such that \fB\fC(nth-1)*page_size <= rank < nth*page_size\fR\&. In other
 words, this operator is almost equivalent to the following definition
 (ignoring negative page indexes for simplicity):
 .PP
@@ -38,7 +38,7 @@ def page(operand, order, nth, page_size)
   allbut(
     restrict(
       rank(operand, order, :rank),
-      lte((nth\-1)*page_size, :rank) & lt(:rank, nth*page_size)),
+      lte((nth-1)*page_size, :rank) & lt(:rank, nth*page_size)),
     [:rank])
 end
 page(suppliers, [:status, :sid], 1, 3)

data/doc/man/project.man

@@ -5,7 +5,7 @@ Keeps only a subset of attributes.
 .PP
 .RS
 .nf
-project(operand: Relation, attributes: AttrList) \-> Relation
+project(operand: Relation, attributes: AttrList) -> Relation
 .fi
 .RE
 .SH Examples

data/doc/man/rank.man

@@ -5,7 +5,7 @@ Tuple ranking
 .PP
 .RS
 .nf
-rank(operand: Relation, order: Ordering, as: AttrName) \-> Relation
+rank(operand: Relation, order: Ordering, as: AttrName) -> Relation
 .fi
 .RE
 .SH Examples

data/doc/man/rename.man

@@ -5,7 +5,7 @@ Rename attributes
 .PP
 .RS
 .nf
-rename(operand: Relation, renaming: Renaming) \-> Relation
+rename(operand: Relation, renaming: Renaming) -> Relation
 .fi
 .RE
 .SH Examples

data/doc/man/restrict.man

@@ -5,7 +5,7 @@ Predicate\-based filtering
 .PP
 .RS
 .nf
-restrict(operand: Relation, predicate: Predicate) \-> Relation
+restrict(operand: Relation, predicate: Predicate) -> Relation
 .fi
 .RE
 .SH Examples
@@ -24,7 +24,7 @@ restrict(suppliers, eq(city: 'Paris') & gt(:status, 20))
 .PP
 .RS
 .nf
-restrict(suppliers, \->(t){ t.city == 'Paris' and t.status > 20 })
+restrict(suppliers, ->(t){ t.city == 'Paris' and t.status > 20 })
 .fi
 .RE
 .SH Description

data/doc/man/stddev.man

@@ -5,7 +5,7 @@ Standard deviation
 .PP
 .RS
 .nf
-stddev(expr: AttrName|(Tuple\->Numeric)) \-> Aggregator
+stddev(expr: AttrName|(Tuple->Numeric)) -> Aggregator
 .fi
 .RE
 .SH Examples
@@ -24,7 +24,7 @@ stddev{|t| t.qty * t.price }
 .PP
 .RS
 .nf
-stddev(\->(t){ t.qty * t.price })
+stddev(->(t){ t.qty * t.price })
 .fi
 .RE
 .SH Description

data/doc/man/sum.man

@@ -5,7 +5,7 @@ Arithmetic sum
 .PP
 .RS
 .nf
-sum(expr: AttrName|(Tuple\->Numeric)) \-> Aggregator
+sum(expr: AttrName|(Tuple->Numeric)) -> Aggregator
 .fi
 .RE
 .SH Examples
@@ -24,7 +24,7 @@ sum{|t| t.qty * t.price }
 .PP
 .RS
 .nf
-sum(\->(t){ t.qty * t.price })
+sum(->(t){ t.qty * t.price })
 .fi
 .RE
 .SH Description

data/doc/man/summarize.man

@@ -5,7 +5,7 @@ Aggregate and compute
 .PP
 .RS
 .nf
-summarize(operand: Relation, by: AttrList, aggs: Summarization) \-> Relation
+summarize(operand: Relation, by: AttrList, aggs: Summarization) -> Relation
 .fi
 .RE
 .SH Examples

data/doc/man/tautology.man

@@ -5,7 +5,7 @@ TRUE
 .PP
 .RS
 .nf
-tautology() \-> Predicate
+tautology() -> Predicate
 .fi
 .RE
 .SH Examples
@@ -23,4 +23,4 @@ tautology
 .RE
 .SH Description
 .PP
-This predicate always return true. It is equivalent to \fB\fC\->(t){ true }\fR\&.
+This predicate always return true. It is equivalent to \fB\fC->(t){ true }\fR\&.

data/doc/man/ungroup.man

@@ -5,7 +5,7 @@ Inverse of group
 .PP
 .RS
 .nf
-ungroup(operand: Relation, rva: AttrName) \-> Relation
+ungroup(operand: Relation, rva: AttrName) -> Relation
 .fi
 .RE
 .SH Examples

data/doc/man/union.man

@@ -5,7 +5,7 @@ Logical OR
 .PP
 .RS
 .nf
-union(left: Relation, right: Relation) \-> Relation
+union(left: Relation, right: Relation) -> Relation
 .fi
 .RE
 .SH Examples

data/doc/man/unwrap.man

@@ -5,7 +5,7 @@ Inverse of wrap
 .PP
 .RS
 .nf
-unwrap(operand: Relation, tva: AttrName) \-> Relation
+unwrap(operand: Relation, tva: AttrName) -> Relation
 .fi
 .RE
 .SH Examples
@@ -23,7 +23,7 @@ Unwrapping of \fB\fCtva\fR on an input tuple \fB\fCt\fR consists in removing \fB
 .PP
 .RS
 .nf
-Tuple(x: 1, tva: Tuple(y: 2, z: 3)) \-> Tuple(x: 1, y: 2, z: 3)
+Tuple(x: 1, tva: Tuple(y: 2, z: 3)) -> Tuple(x: 1, y: 2, z: 3)
 .fi
 .RE
 .PP

data/doc/man/variance.man

@@ -5,7 +5,7 @@ Variance
 .PP
 .RS
 .nf
-variance(expr: AttrName|(Tuple\->Numeric)) \-> Aggregator
+variance(expr: AttrName|(Tuple->Numeric)) -> Aggregator
 .fi
 .RE
 .SH Examples
@@ -24,7 +24,7 @@ variance{|t| t.qty * t.price }
 .PP
 .RS
 .nf
-variance(\->(t){ t.qty * t.price })
+variance(->(t){ t.qty * t.price })
 .fi
 .RE
 .SH Description

data/doc/man/wrap.man

@@ -5,7 +5,7 @@ Tuple\-valued attribute
 .PP
 .RS
 .nf
-wrap(operand: Relation, attributes: AttrList, as: AttrName) \-> Relation
+wrap(operand: Relation, attributes: AttrList, as: AttrName) -> Relation
 .fi
 .RE
 .SH Examples

data/lib/alf/shell/version.rb

@@ -4,7 +4,7 @@ module Alf
 
       MAJOR = 0
       MINOR = 16
-      TINY  = 3
+      TINY  = 4
 
       def self.to_s
         [ MAJOR, MINOR, TINY ].join('.')

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: alf-shell
 version: !ruby/object:Gem::Version
-  version: 0.16.3
+  version: 0.16.4
   prerelease: 
 platform: ruby
 authors:
@@ -9,7 +9,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-07-25 00:00:00.000000000 Z
+date: 2014-09-12 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rake
@@ -50,7 +50,7 @@ dependencies:
     requirements:
     - - '='
       - !ruby/object:Gem::Version
-        version: 0.16.3
+        version: 0.16.4
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
@@ -58,7 +58,7 @@ dependencies:
     requirements:
     - - '='
       - !ruby/object:Gem::Version
-        version: 0.16.3
+        version: 0.16.4
 - !ruby/object:Gem::Dependency
   name: quickl
   requirement: !ruby/object:Gem::Requirement
@@ -96,17 +96,17 @@ dependencies:
   requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
-    - - '='
+    - - ~>
       - !ruby/object:Gem::Version
-        version: 0.16.3
+        version: '0.16'
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     none: false
     requirements:
-    - - '='
+    - - ~>
       - !ruby/object:Gem::Version
-        version: 0.16.3
+        version: '0.16'
 description: This project implements the `alf` commandline tool.
 email:
 - blambeau at gmail.com
@@ -163,11 +163,11 @@ files:
 - doc/man/unwrap.man
 - doc/man/variance.man
 - doc/man/wrap.man
-- doc/txt/alf-explain.man
-- doc/txt/alf-metadata.man
-- doc/txt/alf-repl.man
-- doc/txt/alf-show.man
-- doc/txt/alf.man
+- doc/txt/alf-explain.txt
+- doc/txt/alf-metadata.txt
+- doc/txt/alf-repl.txt
+- doc/txt/alf-show.txt
+- doc/txt/alf.txt
 - doc/txt/allbut.txt
 - doc/txt/among.txt
 - doc/txt/avg.txt
@@ -282,7 +282,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
       version: '0'
       segments:
       - 0
-      hash: 2411711699215744783
+      hash: -3355132787973744618
 required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
   requirements:
@@ -291,7 +291,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
       segments:
       - 0
-      hash: 2411711699215744783
+      hash: -3355132787973744618
 requirements: []
 rubyforge_project: 
 rubygems_version: 1.8.25