Diamond in CFML
Given a letter, print a diamond starting with 'A' with the supplied letter at the widest point.
exercism fetch cfml diamond
The diamond kata takes as its input a letter, and outputs it in a diamond shape. Given a letter, it prints a diamond starting with 'A', with the supplied letter at the widest point.
- The first row contains one 'A'.
- The last row contains one 'A'.
- All rows, except the first and last, have exactly two identical letters.
- All rows have as many trailing spaces as leading spaces. (This might be 0).
- The diamond is horizontally symmetric.
- The diamond is vertically symmetric.
- The diamond has a square shape (width equals height).
- The letters form a diamond shape.
- The top half has the letters in ascending order.
- The bottom half has the letters in descending order.
- The four corners (containing the spaces) are triangles.
In the following examples, spaces are indicated by
Diamond for letter 'A':
Diamond for letter 'C':
Diamond for letter 'E':
····A···· ···B·B··· ··C···C·· ·D·····D· E·······E ·D·····D· ··C···C·· ···B·B··· ····A····
To run the code in this exercise, you will only need to have CommandBox CLI installed. This binary runs CFML code from the command line.
To run the tests,
cd into the exercise folder and run the following:
box task run TestRunner # Or start up a test watcher that will rerun when files change box task run TestRunner --:watcher
The tests leverage a library called TestBox which supports xUnit and BDD style of testing. All test suites will be written in the BDD style which uses closures to define test specs. You won't need to worry about installing TestBox. The CLI test runner will take care of that for you. You just need to be connected to the internet the first time you run it. You can read more about it here:
Submitting Incomplete Solutions
It's possible to submit an incomplete solution so you can see how others have completed the exercise.