| LCOV - code coverage report | ||||||||||||||||||||||
 | ||||||||||||||||||||||
+
|
+ ||||||||||||||||||||||
|
| + | + | + | + | + | ||
Directory  |
+ Line Coverage |
+ Functions |
+ ||||
| lib | +
+
|
+ 100.0 % | +7 / 7 | +- | +0 / 0 | +|
|
| Generated by: LCOV version 1.16 |
| LCOV - code coverage report | ||||||||||||||||||||||
| ||||||||||||||||||||||
+
|
+ ||||||||||||||||||||||
|
| + | + | + | + | + | ||
| Directory |
+ Line Coverage |
+ Functions |
+ ||||
| lib | +
+
|
+ 100.0 % | +7 / 7 | +- | +0 / 0 | +|
|
| Generated by: LCOV version 1.16 |
| LCOV - code coverage report | ||||||||||||||||||||||
| ||||||||||||||||||||||
+
|
+ ||||||||||||||||||||||
|
| + | + | + | + | + | ||
| Directory |
+ Line Coverage |
+ Functions |
+ ||||
| lib | +
+
|
+ 100.0 % | +7 / 7 | +- | +0 / 0 | +|
|
| Generated by: LCOV version 1.16 |
| LCOV - code coverage report | ||||||||||||||||||||||
 | ||||||||||||||||||||||
+
|
+ ||||||||||||||||||||||
|
| + | + | + | + | + | ||
Filename  |
+ Line Coverage |
+ Functions |
+ ||||
| pangram.dart | +
+
|
+ 100.0 % | +7 / 7 | +- | +0 / 0 | +|
|
| Generated by: LCOV version 1.16 |
| LCOV - code coverage report | ||||||||||||||||||||||
| ||||||||||||||||||||||
+
|
+ ||||||||||||||||||||||
|
| + | + | + | + | + | ||
| Filename |
+ Line Coverage |
+ Functions |
+ ||||
| pangram.dart | +
+
|
+ 100.0 % | +7 / 7 | +- | +0 / 0 | +|
|
| Generated by: LCOV version 1.16 |
| LCOV - code coverage report | ||||||||||||||||||||||
| ||||||||||||||||||||||
+
|
+ ||||||||||||||||||||||
|
| + | + | + | + | + | ||
| Filename |
+ Line Coverage |
+ Functions |
+ ||||
| pangram.dart | +
+
|
+ 100.0 % | +7 / 7 | +- | +0 / 0 | +|
|
| Generated by: LCOV version 1.16 |
| LCOV - code coverage report | ||||||||||||||||||||||
| ||||||||||||||||||||||
+
|
+ ||||||||||||||||||||||
|
| Function Name |
+ Hit count |
+
|
| Generated by: LCOV version 1.16 |
| LCOV - code coverage report | ||||||||||||||||||||||
| ||||||||||||||||||||||
+
|
+ ||||||||||||||||||||||
|
| Function Name |
+ Hit count |
+
|
| Generated by: LCOV version 1.16 |
| LCOV - code coverage report | ||||||||||||||||||||||
| ||||||||||||||||||||||
+
|
+ ||||||||||||||||||||||
|
+Line data Source code+ + 1 : class Pangram { + 2 2 : bool isPangram(String text) { + 3 8 : if (text.isEmpty | (text.length < 26)) { + 4 : return false; + 5 : } + 6 : + 7 : var letters = <String>{}; + 8 : letters = text + 9 1 : .toLowerCase() + 10 1 : .split('') + 11 4 : .where((rune) => RegExp(r'^[a-z]$').hasMatch(rune)) + 12 1 : .toSet(); + 13 : + 14 2 : return letters.length == 26; + 15 : } + 16 : } ++ |
+
|
| Generated by: LCOV version 1.16 |
You've tried to visit a page that doesn't exist. Luckily this site + has other pages.
+If you were looking for something specific, try searching: +
+ + +Welcome to Pangram on Exercism's Dart Track.
+If you need help running the tests or submitting your code, check out HELP.md.
You work for a company that sells fonts through their website. +They'd like to show a different sentence each time someone views a font on their website. +To give a comprehensive sense of the font, the random sentences should use all the letters in the English alphabet.
+They're running a competition to get suggestions for sentences that they can use. +You're in charge of checking the submissions to see if they are valid.
+
Pangram comes from Greek, παν γράμμα, pan gramma, which means "every letter".
+
+The best known English pangram is:
+
+> The quick brown fox jumps over the lazy dog.
+Your task is to figure out if a sentence is a pangram.
+A pangram is a sentence using every letter of the alphabet at least once.
+It is case insensitive, so it doesn't matter if a letter is lower-case (e.g. k) or upper-case (e.g. K).
For this exercise, a sentence is a pangram if it contains each of the 26 letters in the English alphabet.
+Wikipedia - https://en.wikipedia.org/wiki/Pangram
+bool isPangram(String text) {
+ if (text.isEmpty | (text.length < 26)) {
+ return false;
+ }
+
+ var letters = <String>{};
+ letters = text
+ .toLowerCase()
+ .split('')
+ .where((rune) => RegExp(r'^[a-z]$').hasMatch(rune))
+ .toSet();
+
+ return letters.length == 26;
+}