-
-
Notifications
You must be signed in to change notification settings - Fork 22
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
6 changed files
with
105 additions
and
106 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,23 +1,23 @@ | ||
| { | ||
| "authors": [ | ||
| "kapitaali" | ||
| "authors": [ | ||
| "kapitaali" | ||
| ], | ||
| "files": { | ||
| "solution": [ | ||
| "src/acronym.cob" | ||
| ], | ||
| "files": { | ||
| "solution": [ | ||
| "src/acronym.cob" | ||
| ], | ||
| "test": [ | ||
| "tst/acronym/acronym.cut" | ||
| ], | ||
| "example": [ | ||
| ".meta/proof.ci.cob" | ||
| ], | ||
| "invalidator": [ | ||
| "test.sh", | ||
| "test.ps1" | ||
| ] | ||
| }, | ||
| "blurb": "Convert a phrase to its acronym.", | ||
| "source": "Julien Vanier", | ||
| "source_url": "https://github.com/monkbroc" | ||
| } | ||
| "test": [ | ||
| "tst/acronym/acronym.cut" | ||
| ], | ||
| "example": [ | ||
| ".meta/proof.ci.cob" | ||
| ], | ||
| "invalidator": [ | ||
| "test.sh", | ||
| "test.ps1" | ||
| ] | ||
| }, | ||
| "blurb": "Convert a long phrase to its acronym.", | ||
| "source": "Julien Vanier", | ||
| "source_url": "https://github.com/monkbroc" | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,23 +1,23 @@ | ||
| { | ||
| "authors": [ | ||
| "kapitaali" | ||
| "authors": [ | ||
| "kapitaali" | ||
| ], | ||
| "files": { | ||
| "solution": [ | ||
| "src/circular-buffer.cob" | ||
| ], | ||
| "files": { | ||
| "solution": [ | ||
| "src/circular-buffer.cob" | ||
| ], | ||
| "test": [ | ||
| "tst/circular-buffer/circular-buffer.cut" | ||
| ], | ||
| "example": [ | ||
| ".meta/proof.ci.cob" | ||
| ], | ||
| "invalidator": [ | ||
| "test.sh", | ||
| "test.ps1" | ||
| ] | ||
| }, | ||
| "blurb": "A circular buffer, cyclic buffer or ring buffer is a data structure that uses a single, fixed-size buffer as if it were connected end-to-end.", | ||
| "source": "Wikipedia", | ||
| "source_url": "https://en.wikipedia.org/wiki/Circular_buffer" | ||
| } | ||
| "test": [ | ||
| "tst/circular-buffer/circular-buffer.cut" | ||
| ], | ||
| "example": [ | ||
| ".meta/proof.ci.cob" | ||
| ], | ||
| "invalidator": [ | ||
| "test.sh", | ||
| "test.ps1" | ||
| ] | ||
| }, | ||
| "blurb": "A data structure that uses a single, fixed-size buffer as if it were connected end-to-end.", | ||
| "source": "Wikipedia", | ||
| "source_url": "https://en.wikipedia.org/wiki/Circular_buffer" | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,23 +1,23 @@ | ||
| { | ||
| "authors": [ | ||
| "kapitaali" | ||
| "authors": [ | ||
| "kapitaali" | ||
| ], | ||
| "files": { | ||
| "solution": [ | ||
| "src/complex-numbers.cob" | ||
| ], | ||
| "files": { | ||
| "solution": [ | ||
| "src/complex-numbers.cob" | ||
| ], | ||
| "test": [ | ||
| "tst/complex-numbers/complex-numbers.cut" | ||
| ], | ||
| "example": [ | ||
| ".meta/proof.ci.cob" | ||
| ], | ||
| "invalidator": [ | ||
| "test.sh", | ||
| "test.ps1" | ||
| ] | ||
| }, | ||
| "blurb": "A complex number is a number in the form a + b * i where a and b are real and i satisfies i^2 = -1.", | ||
| "source": "Wikipedia", | ||
| "source_url": "https://en.wikipedia.org/wiki/Complex_number" | ||
| } | ||
| "test": [ | ||
| "tst/complex-numbers/complex-numbers.cut" | ||
| ], | ||
| "example": [ | ||
| ".meta/proof.ci.cob" | ||
| ], | ||
| "invalidator": [ | ||
| "test.sh", | ||
| "test.ps1" | ||
| ] | ||
| }, | ||
| "blurb": "Implement complex numbers.", | ||
| "source": "Wikipedia", | ||
| "source_url": "https://en.wikipedia.org/wiki/Complex_number" | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,23 +1,22 @@ | ||
| { | ||
| "authors": [ | ||
| "kapitaali" | ||
| "authors": [ | ||
| "kapitaali" | ||
| ], | ||
| "files": { | ||
| "solution": [ | ||
| "src/matching-brackets.cob" | ||
| ], | ||
| "files": { | ||
| "solution": [ | ||
| "src/matching-brackets.cob" | ||
| ], | ||
| "test": [ | ||
| "tst/matching-brackets/matching-brackets.cut" | ||
| ], | ||
| "example": [ | ||
| ".meta/proof.ci.cob" | ||
| ], | ||
| "invalidator": [ | ||
| "test.sh", | ||
| "test.ps1" | ||
| ] | ||
| }, | ||
| "blurb": "Bob is a lackadaisical teenager. In conversation, his responses are very limited.", | ||
| "source": "Inspired by the 'Deaf Grandma' exercise in Chris Pine's Learn to Program tutorial.", | ||
| "source_url": "http://pine.fm/LearnToProgram/?Chapter=06" | ||
| } | ||
| "test": [ | ||
| "tst/matching-brackets/matching-brackets.cut" | ||
| ], | ||
| "example": [ | ||
| ".meta/proof.ci.cob" | ||
| ], | ||
| "invalidator": [ | ||
| "test.sh", | ||
| "test.ps1" | ||
| ] | ||
| }, | ||
| "blurb": "Make sure the brackets and braces all match.", | ||
| "source": "Ginna Baker" | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,23 +1,23 @@ | ||
| { | ||
| "authors": [ | ||
| "kapitaali" | ||
| "authors": [ | ||
| "kapitaali" | ||
| ], | ||
| "files": { | ||
| "solution": [ | ||
| "src/pascals-triangle.cob" | ||
| ], | ||
| "files": { | ||
| "solution": [ | ||
| "src/pascals-triangle.cob" | ||
| ], | ||
| "test": [ | ||
| "tst/pascals-triangle/pascals-triangle.cut" | ||
| ], | ||
| "example": [ | ||
| ".meta/proof.ci.cob" | ||
| ], | ||
| "invalidator": [ | ||
| "test.sh", | ||
| "test.ps1" | ||
| ] | ||
| }, | ||
| "blurb": "Compute Pascal's triangle up to a given number of rows.", | ||
| "source": "Pascal's Triangle at Wolfram Math World", | ||
| "source_url": "http://mathworld.wolfram.com/PascalsTriangle.html" | ||
| } | ||
| "test": [ | ||
| "tst/pascals-triangle/pascals-triangle.cut" | ||
| ], | ||
| "example": [ | ||
| ".meta/proof.ci.cob" | ||
| ], | ||
| "invalidator": [ | ||
| "test.sh", | ||
| "test.ps1" | ||
| ] | ||
| }, | ||
| "blurb": "Compute Pascal's triangle up to a given number of rows.", | ||
| "source": "Pascal's Triangle at Wolfram Math World", | ||
| "source_url": "https://www.wolframalpha.com/input/?i=Pascal%27s+triangle" | ||
| } |