trackler 2.2.1.104 → 2.2.1.105

data/tracks/cfml/exercises/word-count/README.md

@@ -4,14 +4,13 @@ Given a phrase, count the occurrences of each word in that phrase.
 
 For example for the input `"olly olly in come free"`
 
-```plain
+```text
 olly: 2
 in: 1
 come: 1
 free: 1
 ```
 
-
 * * * *
 
 To run the code in this exercise, you will only need to have [CommandBox CLI installed](https://ortus.gitbooks.io/commandbox-documentation/content/setup/installation.html).  This binary runs CFML code from the command line.

data/tracks/cfml/exercises/word-count/Solution.cfc

@@ -3,8 +3,8 @@
 */
 component {
 		
-	function countwords( input ) {
-		return input
+	function countwords( sentence ) {
+		return sentence
 			// Strip out chars we don't care about
 			.reReplaceNoCase( '[^a-z0-9'' ]', '', 'all' )
 			// Break string into array

data/tracks/cfml/exercises/word-count/WordCount.cfc

@@ -6,7 +6,7 @@ component {
 	/**
 	* @returns 
 	*/
-	function countwords( input ) {
+	function countwords( sentence ) {
 		// Implement me here
 	}
 	

data/tracks/cfml/exercises/word-count/WordCountTest.cfc

@@ -9,43 +9,47 @@ component extends="testbox.system.BaseSpec" {
 		describe( "My WordCount class", function(){			
 
 			it( 'count one word', function(){
-				expect( SUT.countwords( input='word' ) ).toBe( {"word":1} );
+				expect( SUT.countWords( sentence='word' ) ).toBe( {"word":1} );
 			});
 
 			it( 'count one of each word', function(){
-				expect( SUT.countwords( input='one of each' ) ).toBe( {"one":1,"of":1,"each":1} );
+				expect( SUT.countWords( sentence='one of each' ) ).toBe( {"one":1,"of":1,"each":1} );
 			});
 
 			it( 'multiple occurrences of a word', function(){
-				expect( SUT.countwords( input='one fish two fish red fish blue fish' ) ).toBe( {"one":1,"fish":4,"two":1,"red":1,"blue":1} );
+				expect( SUT.countWords( sentence='one fish two fish red fish blue fish' ) ).toBe( {"one":1,"fish":4,"two":1,"red":1,"blue":1} );
 			});
 
 			it( 'handles cramped lists', function(){
-				expect( SUT.countwords( input='one, two, three' ) ).toBe( {"one":1,"two":1,"three":1} );
+				expect( SUT.countWords( sentence='one, two, three' ) ).toBe( {"one":1,"two":1,"three":1} );
 			});
 
 			it( 'handles expanded lists', function(){
-				expect( SUT.countwords( input='one, #chr( 10 )#two, #chr( 10 )#three' ) ).toBe( {"one":1,"two":1,"three":1} );
+				expect( SUT.countWords( sentence='one, #chr( 10 )#two, #chr( 10 )#three' ) ).toBe( {"one":1,"two":1,"three":1} );
 			});
 
 			it( 'ignore punctuation', function(){
-				expect( SUT.countwords( input='car: carpet as java: javascript!!&@$%^&' ) ).toBe( {"car":1,"carpet":1,"as":1,"java":1,"javascript":1} );
+				expect( SUT.countWords( sentence='car: carpet as java: javascript!!&@$%^&' ) ).toBe( {"car":1,"carpet":1,"as":1,"java":1,"javascript":1} );
 			});
 
 			it( 'include numbers', function(){
-				expect( SUT.countwords( input='testing,  1,  2 testing' ) ).toBe( {"testing":2,"1":1,"2":1} );
+				expect( SUT.countWords( sentence='testing,  1,  2 testing' ) ).toBe( {"testing":2,"1":1,"2":1} );
 			});
 
 			it( 'normalize case', function(){
-				expect( SUT.countwords( input='go Go GO Stop stop' ) ).toBe( {"go":3,"stop":2} );
+				expect( SUT.countWords( sentence='go Go GO Stop stop' ) ).toBe( {"go":3,"stop":2} );
 			});
 
 			it( 'with apostrophes', function(){
-				expect( SUT.countwords( input='First: don''t laugh. Then: don''t cry.' ) ).toBe( {"first":1,"don't":2,"laugh":1,"then":1,"cry":1} );
+				expect( SUT.countWords( sentence='First: don''t laugh. Then: don''t cry.' ) ).toBe( {"first":1,"don't":2,"laugh":1,"then":1,"cry":1} );
 			});
 
 			it( 'with quotations', function(){
-				expect( SUT.countwords( input='Joe can''t tell between ''large'' and large.' ) ).toBe( {"joe":1,"can't":1,"tell":1,"between":1,"large":2,"and":1} );
+				expect( SUT.countWords( sentence='Joe can''t tell between ''large'' and large.' ) ).toBe( {"joe":1,"can't":1,"tell":1,"between":1,"large":2,"and":1} );
+			});
+
+			it( 'multiple spaces not detected as a word', function(){
+				expect( SUT.countWords( sentence=' multiple   whitespaces' ) ).toBe( {"multiple":1,"whitespaces":1} );
 			});
 
 		});

data/tracks/cfml/tasks/GenerateReadme.cfc

@@ -15,7 +15,7 @@ component  {
 		/* Init global variables */
 		repoRootPath = expandPath( getDirectoryFromPath( getCurrentTemplatePath() ) & '../' );
 		problemSpecsPath = expandPath( getDirectoryFromPath( getCurrentTemplatePath() ) & '../../problem-specifications' );
-		trackReadmeInsert= fileRead( repoRootPath & "docs/EXERCISE_README_INSERT.md", "utf-8" );
+		trackReadmeInsert= fileRead( repoRootPath & "config/exercise-readme-insert.md", "utf-8" );
 		overwriteExistingFiles = arguments.force;	
 
 		if( !directoryExists( problemSpecsPath ) ){
@@ -72,7 +72,7 @@ component  {
 				.toConsole();
 		}
 		else {
-			print.redLine("README.md already exists! Use the overwrite=true to overwrite the file.")
+			print.redLine("README.md already exists! Use the :force=true flag to overwrite the file.")
 				.indentedYellowLine( readMeFile )
 				.toConsole();
 		}

data/tracks/cfml/tasks/GenerateTests.cfc

@@ -33,7 +33,7 @@ component {
 		}
 				
 		exercises.each( function( slug ) {
-			
+			print.line( 'Starting [#slug#]' ).toConsole();
 			try {
 				
 				// Slug of hello-world defaults to name of HelloWorld
@@ -118,9 +118,13 @@ component {
 	
 	private function generateInput( case ) {
 		var thisInput = '';
-		for( var key in case ) {
-			if( !listFindNoCase( 'description,property,expected,cases,comments', key ) && !isNull( case[ key ] ) ) {
-				thisInput = thisInput.listAppend( "#key#=#escapeString( case[ key ] )#" );
+		if( case.keyExists( 'input' ) ) {
+			if( isStruct( case.input ) ) {
+				for( var key in case.input ) {
+					thisInput = thisInput.listAppend( "#key#=#escapeString( case.input[ key ] )#" );
+				}
+			} else {
+				thisInput = thisInput.listAppend( "input=#escapeString( case.input )#" );				
 			}
 		}
 		if( thisInput.len() ) {
@@ -165,11 +169,20 @@ component {
 		arguments.arg = replaceNoCase( arguments.arg, '\\', '__double_backslash_', 'all' );
 		arguments.arg = replaceNoCase( arguments.arg, '\/', '/', 'all' );
 		arguments.arg = replaceNoCase( arguments.arg, '\"', '""', 'all' );
+		arguments.arg = replaceNoCase( arguments.arg, '##', '####', 'all' );
 		arguments.arg = replaceNoCase( arguments.arg, '\t', '	', 'all' );
 		arguments.arg = replaceNoCase( arguments.arg, '\n', chr(13)&chr(10), 'all' );
 		arguments.arg = replaceNoCase( arguments.arg, '\r', chr(13), 'all' );
 		arguments.arg = replaceNoCase( arguments.arg, '\f', chr(12), 'all' );
 		arguments.arg = replaceNoCase( arguments.arg, '\b', chr(8), 'all' );
+		
+		// A null keyword must be preceede dby a , [ : or start of string.  
+		// TODO: This doesn't account for the word "null" inside a quoted string.  I'd need to actually parse the string to detect that.
+		arguments.arg = reReplaceNoCase( arguments.arg, '(,\s*)null', '\1nullValue()', 'all' );
+		arguments.arg = reReplaceNoCase( arguments.arg, '(\[\s*)null', '\1nullValue()', 'all' );
+		arguments.arg = reReplaceNoCase( arguments.arg, '(:\s*)null', '\1nullValue()', 'all' );
+		arguments.arg = reReplaceNoCase( arguments.arg, '^null', 'nullValue()', 'all' );
+		
 		// This doesn't work-- I'd need to do it in a loop and replace each one individually.  Meh...
 		// arguments.arg = reReplaceNoCase( arguments.arg, '\\u([0-9a-f]{4})', chr( inputBaseN( '\1', 16 ) ), 'all' );
 		arguments.arg = replaceNoCase( arguments.arg, '__double_backslash_', '\', 'all' );

data/tracks/cfml/tasks/TestAllSolutions.cfc

@@ -6,6 +6,7 @@ component {
 	function run() {
 		// Get an array of all the excercise names
 		var exercises = directoryList( expandPath( getDirectoryFromPath( getCurrentTemplatePath() ) & '../exercises' ) );
+		var exitCode = 0;
 		
 		// If there's a testrunner task in them, run it.  If any of the tasks fail, the exit code will come back as 1
 		exercises.each( function( path ) {
@@ -16,9 +17,11 @@ component {
 					.flags( ':solution' )
 					.inWorkingDirectory( path )
 					.run();
+				exitCode = max( exitCode, createObject( 'java', 'java.lang.System' ).getProperty( 'cfml.cli.exitCode' ) ?: 0 ); 
 			}
 		} );
 		
+		setExitCode( exitCode );		
 	}
 	
 }

data/tracks/common-lisp/config/exercise_readme.go.tmpl

@@ -4,10 +4,52 @@
 {{- with .Hints }}
 {{ . }}
 {{ end }}
-{{- with .TrackInsert }}
-{{ . }}
-{{ end }}
-{{- with .Spec.Credits -}}
+## Setup
+
+Check out [Exercism Help](http://exercism.io/languages/lisp) for instructions to
+get started writing Common Lisp. That page will explain how to install and setup
+a Lisp implementation and how to run the tests.
+
+## Formatting
+
+While Common Lisp doesn't care about indentation and layout of code,
+nor whether you use spaces or tabs, this is an important consideration
+for submissions to exercism.io. Excercism.io's code widget cannot
+handle mixing of tab and space characters well so using only spaces is recommended to make
+the code more readable to the human reviewers. Please review your
+editors settings on how to accomplish this. Below are instructions for
+popular editors for Common Lisp.
+
+### VIM
+
+Use the following commands to ensure VIM uses only spaces for
+indentation:
+
+```vimscript
+:set tabstop=2
+:set shiftwidth=2
+:set expandtab
+```
+
+(or as a oneliner `:set tabstop=2 shiftwidth=2 expandtab`). This can
+be added to your `~/.vimrc` file to use it all the time.
+
+### Emacs
+
+Emacs is very well suited for editing Common Lisp and has many
+powerful add-on packages available. The only thing that one needs to
+do with a stock emacs to make it work well with exercism.io is to
+evaluate the following code:
+
+`(setq indent-tab-mode nil)`
+
+This can be placed in your `~/.emacs` (or `~/.emacs.d/init.el`) in
+order to have it set whenever Emacs is launched.
+
+One suggested add-on for Emacs and Common Lisp is
+[SLIME](https://github.com/slime/slime) which offers tight integration
+with the REPL; making iterative coding and testing very easy.
+{{ with .Spec.Credits }}
 ## Source
 
 {{ . }}

data/tracks/common-lisp/exercises/acronym/README.md

@@ -9,7 +9,7 @@ like Portable Network Graphics to its acronym (PNG).
 
 ## Setup
 
-Check out [Exercism Help](http://exercism.io/languages/common-lisp) for instructions to
+Check out [Exercism Help](http://exercism.io/languages/lisp) for instructions to
 get started writing Common Lisp. That page will explain how to install and setup
 a Lisp implementation and how to run the tests.
 

data/tracks/common-lisp/exercises/beer-song/README.md

@@ -1,6 +1,6 @@
 # Beer Song
 
-Produce the lyrics to that beloved classic, that field-trip favorite: 99 Bottles of Beer on the Wall.
+Recite the lyrics to that beloved classic, that field-trip favorite: 99 Bottles of Beer on the Wall.
 
 Note that not all verses are identical.
 

data/tracks/common-lisp/exercises/crypto-square/README.md

@@ -45,12 +45,14 @@ The message above is coded as:
 imtgdvsfearwermayoogoanouuiontnnlvtwttddesaohghnsseoau
 ```
 
-Output the encoded text in chunks.  Phrases that fill perfect squares
-`(r X r)` should be output in `r`-length chunks separated by spaces.
-Imperfect squares will have `n` empty spaces.  Those spaces should be distributed evenly across the last `n` rows.
+Output the encoded text in chunks.  Phrases that fill perfect rectangles
+`(r X c)` should be output `c` chunks of `r` length, separated by spaces.
+Phrases that do not fill perfect rectangles will have `n` empty spaces.
+Those spaces should be distributed evenly, added to the end of the last
+`n` chunks.
 
 ```text
-imtgdvs fearwer mayoogo anouuio ntnnlvt wttddes aohghn sseoau
+imtgdvs fearwer mayoogo anouuio ntnnlvt wttddes aohghn  sseoau 
 ```
 
 Notice that were we to stack these, we could visually decode the

data/tracks/common-lisp/exercises/etl/README.md

@@ -1,4 +1,4 @@
-# Etl
+# ETL
 
 We are going to do the `Transform` step of an Extract-Transform-Load.
 
@@ -48,7 +48,7 @@ game while being scored at 4 in the Hawaiian-language version.
 
 ## Setup
 
-Check out [Exercism Help](http://exercism.io/languages/common-lisp) for instructions to
+Check out [Exercism Help](http://exercism.io/languages/lisp) for instructions to
 get started writing Common Lisp. That page will explain how to install and setup
 a Lisp implementation and how to run the tests.
 

data/tracks/common-lisp/exercises/isogram/README.md

@@ -1,3 +1,5 @@
+# Isogram
+
 Determine if a word or phrase is an isogram.
 
 An isogram (also known as a "nonpattern word") is a word or phrase without a repeating letter, however spaces and hyphens are allowed to appear multiple times.
@@ -59,7 +61,7 @@ with the REPL; making iterative coding and testing very easy.
 
 ## Source
 
-Learn more about Isograms at [wikipedia](https://en.wikipedia.org/wiki/Isogram)
+Wikipedia [https://en.wikipedia.org/wiki/Isogram](https://en.wikipedia.org/wiki/Isogram)
 
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/common-lisp/exercises/meetup/README.md

@@ -2,25 +2,29 @@
 
 Calculate the date of meetups.
 
-Typically meetups happen on the same day of the week.  In this exercise, you will take
-a description of a meetup date, and return the actual meetup date.
+Typically meetups happen on the same day of the week.  In this exercise, you
+will take a description of a meetup date, and return the actual meetup date.
 
 Examples of general descriptions are:
 
-- the first Monday of January 2017
-- the third Tuesday of January 2017
-- the Wednesteenth of January 2017
-- the last Thursday of January 2017
+- The first Monday of January 2017
+- The third Tuesday of January 2017
+- The wednesteenth of January 2017
+- The last Thursday of January 2017
 
-Note that "Monteenth", "Tuesteenth", etc are all made up words. There
-was a meetup whose members realized that there are exactly 7 numbered days in a month that
-end in '-teenth'. Therefore, one is guaranteed that each day of the week
+The descriptors you are expected to parse are:
+first, second, third, fourth, fifth, last, monteenth, tuesteenth, wednesteenth,
+thursteenth, friteenth, saturteenth, sunteenth
+
+Note that "monteenth", "tuesteenth", etc are all made up words. There was a
+meetup whose members realized that there are exactly 7 numbered days in a month
+that end in '-teenth'. Therefore, one is guaranteed that each day of the week
 (Monday, Tuesday, ...) will have exactly one date that is named with '-teenth'
 in every month.
 
-Given examples of a meetup dates, each containing a month, day, year, and descriptor
-(first, second, teenth, etc), calculate the date of the actual meetup.
-For example, if given "First Monday of January 2017", the correct meetup date is 2017/1/2
+Given examples of a meetup dates, each containing a month, day, year, and
+descriptor calculate the date of the actual meetup.  For example, if given
+"The first Monday of January 2017", the correct meetup date is 2017/1/2.
 
 ## Setup
 

data/tracks/common-lisp/exercises/nucleotide-count/README.md

@@ -2,8 +2,8 @@
 
 Given a single stranded DNA string, compute how many times each nucleotide occurs in the string.
 
-The genetic language of every living thing on the planet is DNA. 
-DNA is a large molecule that is built from an extremely long sequence of individual elements called nucleotides. 
+The genetic language of every living thing on the planet is DNA.
+DNA is a large molecule that is built from an extremely long sequence of individual elements called nucleotides.
 4 types exist in DNA and these differ only slightly and can be represented as the following symbols: 'A' for adenine, 'C' for cytosine, 'G' for guanine, and 'T' thymine.
 
 Here is an analogy:

data/tracks/common-lisp/exercises/pascals-triangle/README.md

@@ -1,4 +1,4 @@
-# Pascals Triangle
+# Pascal's Triangle
 
 Compute Pascal's triangle up to a given number of rows.
 

data/tracks/common-lisp/exercises/phone-number/README.md

@@ -14,7 +14,7 @@ The format is usually represented as
 
 where `N` is any digit from 2 through 9 and `X` is any digit from 0 through 9.
 
-Your task is to clean up differently formated telephone numbers by removing punctuation and the country code (1) if present.
+Your task is to clean up differently formatted telephone numbers by removing punctuation and the country code (1) if present.
 
 For example, the inputs
 - `+1 (613)-995-0253`

data/tracks/common-lisp/exercises/rna-transcription/README.md

@@ -1,4 +1,4 @@
-# Rna Transcription
+# RNA Transcription
 
 Given a DNA strand, return its RNA complement (per RNA transcription).
 
@@ -66,7 +66,7 @@ with the REPL; making iterative coding and testing very easy.
 
 ## Source
 
-Rosalind [http://rosalind.info/problems/rna](http://rosalind.info/problems/rna)
+Hyperphysics [http://hyperphysics.phy-astr.gsu.edu/hbase/Organic/transcription.html](http://hyperphysics.phy-astr.gsu.edu/hbase/Organic/transcription.html)
 
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/common-lisp/exercises/space-age/README.md

@@ -12,8 +12,7 @@ Given an age in seconds, calculate how old someone would be on:
    - Neptune: orbital period 164.79132 Earth years
 
 So if you were told someone were 1,000,000,000 seconds old, you should
-be able to say that they're 31.69 Earth-years old. Round all ages to
-the nearest hundredth of a year.
+be able to say that they're 31.69 Earth-years old.
 
 If you're wondering why Pluto didn't make the cut, go watch [this
 youtube video](http://www.youtube.com/watch?v=Z_2gbGXzFbs).

data/tracks/common-lisp/exercises/sublist/README.md

@@ -1,3 +1,5 @@
+# Sublist
+
 Given two lists determine if the first list is contained within the second
 list, if the second list is contained within the first list, if both lists are
 contained within each other or if none of these are true.

data/tracks/crystal/config/exercise_readme.go.tmpl

@@ -4,10 +4,28 @@
 {{- with .Hints }}
 {{ . }}
 {{ end }}
-{{- with .TrackInsert }}
-{{ . }}
-{{ end }}
-{{- with .Spec.Credits -}}
+## Setup
+
+Follow the setup instructions for Crystal here:
+
+http://exercism.io/languages/crystal
+
+More help installing can be found here:
+
+http://crystal-lang.org/docs/installation/index.html
+
+## Making the Test Suit Pass
+
+Execute the tests with:
+
+```bash
+$ crystal spec
+```
+
+In each test suite all but the first test have been skipped.
+
+Once you get a test passing, you can unskip the next one by changing `pending` to `it`.
+{{ with .Spec.Credits }}
 ## Source
 
 {{ . }}