--- /dev/null
+# This file is part of NIT ( http://www.nitlanguage.org ).
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+# http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+
+import benitlux_model
+import benitlux_db
+
+# Sort beers by their availability
+class BeerComparator
+ super Comparator
+
+ # 1st sorting priority
+ var map1: HashMap[COMPARED, Comparable]
+
+ # 2nd sorting priority
+ var map2: HashMap[COMPARED, Comparable]
+
+ # Key compare
+ redef fun compare(a, b) do return if map1[a] == map1[b] then
+ map2[a] <=> map2[b]
+ else map1[a] <=> map1[b]
+end
+
+# Use the local DB
+var db_path = "benitlux_sherbrooke.db"
+var db = new DB.open(db_path)
+
+# All known beers
+var beers = db.beers
+assert beers != null
+print "{beers.length} known beers"
+
+# All days
+var all_days = db.days
+assert all_days != null
+print "{all_days.length} days, from {all_days.first} to {all_days.last}"
+
+# Beers availability by days
+var beer2days = new HashMap[Beer, Array[String]]
+for beer in beers do
+ var days = db.days(beer)
+ assert days != null
+ default_comparator.sort days
+ beer2days[beer] = days
+end
+
+# Sort beers by their availability and first date of appearance
+var availability = new HashMap[Beer, Int]
+var appearances = new HashMap[Beer, String]
+for beer in beers do
+ var days = beer2days[beer]
+ if days.not_empty then
+ appearances[beer] = days.first
+ availability[beer] = -days.length # Opposite for inverse sort
+ else
+ appearances[beer] = "err"
+ availability[beer] = 1
+ end
+end
+
+# Sort by availability then appearance
+var sorter: Comparator = new BeerComparator(availability, appearances)
+sorter.sort beers
+
+# List all beers
+print "\nBeers:"
+for beer in beers do
+ var days = beer2days[beer]
+
+ # Skip never-available beers, usually name errors
+ if days.is_empty then continue
+
+ var from = days.first
+ if from == all_days.first then from = " ... "
+
+ var to = days.last
+ if to == all_days.last then to = " ... "
+
+ print "- {days.length}\t{from} {to}\t{beer.name}: {beer.desc}"
+end
+
+# Sort by appearance then availability
+sorter = new BeerComparator(appearances, availability)
+sorter.sort beers
+
+# Display the batch graph
+print "\nBatches:"
+
+# Compute `column_width` days from all the known days
+var column_width = 70
+var days_sample = [for i in column_width.times do all_days[i*all_days.length/column_width]]
+
+for beer in beers do
+ var days = beer2days[beer]
+
+ # Skip never-available beers, usually name errors
+ if days.is_empty then continue
+
+ # Print a line looking like: " ############ ###### ######## : Beer"
+ for s in days_sample do printn if days.has(s) then "#" else " "
+ print ": {beer.name}"
+end
+
+db.close