Sha256: 9cb404aea8cc9faf15d5629ea84cbab37349d6207191c78155f84105966e7c24
Contents?: true
Size: 1.21 KB
Versions: 96
Compression:
Stored size: 1.21 KB
Contents
# Parallel Letter Frequency
Count the frequency of letters in texts using parallel computation.
Parallelism is about doing things in parallel that can also be done
sequentially. A common example is counting the frequency of letters.
Create a function that returns the total frequency of each letter in a
list of texts and that employs parallelism.
## Running tests
Execute the tests with:
```bash
$ elixir bob_test.exs
```
(Replace `bob_test.exs` with the name of the test file.)
### Pending tests
In the test suites, all but the first test have been skipped.
Once you get a test passing, you can unskip the next one by
commenting out the relevant `@tag :pending` with a `#` symbol.
For example:
```elixir
# @tag :pending
test "shouting" do
assert Bob.hey("WATCH OUT!") == "Whoa, chill out!"
end
```
Or, you can enable all the tests by commenting out the
`ExUnit.configure` line in the test suite.
```elixir
# ExUnit.configure exclude: :pending, trace: true
```
For more detailed information about the Elixir track, please
see the [help page](http://exercism.io/languages/elixir).
## Submitting Incomplete Solutions
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
96 entries across 96 versions & 1 rubygems