Edits of README.md, fix small filename bug in app.

apps/bee/README.md

@@ -5,7 +5,8 @@ Word finding game inspired by the NYT spelling bee. Find as many words with 4 or
 letter at the center of the 'hive').
 
 
-Usage:
+## Usage
+
  - tap on letters to type out word
  - swipe left to delete last letter
  - swipe right to enter; the word will turn blue while is being checked against the internal dictionary; once
@@ -15,15 +16,16 @@ Usage:
  - swipe up to view a list of already guessed words; tap on any of them to return to the regular game.
 
 
-Scoring:
+## Scoring
+
 The number of correctly guessed words is displayed on the bottom left, the score on the bottom right. A single point
 is awarded for a 4 letter word, or the number of letters if longer. A pangram is a word that contains all 7 letters at
 least once and yields an additional 7 points. Each game contains at least one pangram.
 
 
-Technical remarks:
-The game uses an internal dictionary consisting of a newline separated list of English words ('bee.words'). The dictionary is fairly
-large (~700kB of flash space) and thus requires appropriate space on the watch and will make installing the app somewhat
+## Technical remarks
+The game uses an internal dictionary consisting of a newline separated list of English words ('bee.words', using the '2of12inf' word list).
+The dictionary is fairly large (~700kB of flash space) and thus requires appropriate space on the watch and will make installing the app somewhat
 slow. Because of its size it cannot be compressed (heatshrink needs to hold the compressed/uncompressed data in memory).
 In order to make checking for the validity of a guessed word faster, an index file ('bee_lindex.json') is installed with
 the app that facilitates faster word lookups. This index file is specific to the dictionary file used. If one were to

apps/bee/bee.app.js

@@ -22,7 +22,7 @@ function prepareLetterIdx () {
       console.log(prefix);
       li.push(words.indexOf("\n"+prefix, li[i-1])+1);
     }
-    li.push(words.length);
+    li.push(require("Storage").read('bee.words').length);
     S.writeJSON("bee_lindex.json", li);
   }
   for (var i=0; i<26; ++i) letterIdx[i] = S.read("bee.words", li[i], li[i+1]-li[i]);