OLD | NEW |
1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file |
2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
4 | 4 |
5 /// Unit tests for markdown. | 5 /// Unit tests for markdown. |
6 #library('markdown_tests'); | 6 #library('markdown_tests'); |
7 | 7 |
8 // TODO(rnystrom): Use "package:" URL (#4968). | 8 // TODO(rnystrom): Use "package:" URL (#4968). |
9 #import('../lib/markdown.dart'); | 9 #import('../lib/markdown.dart'); |
10 #import('../../unittest/lib/unittest.dart'); | 10 |
| 11 // TODO(rnystrom): Better path to unittest. |
| 12 #import('../../unittest/unittest.dart'); |
11 | 13 |
12 /// Most of these tests are based on observing how showdown behaves: | 14 /// Most of these tests are based on observing how showdown behaves: |
13 /// http://softwaremaniacs.org/playground/showdown-highlight/ | 15 /// http://softwaremaniacs.org/playground/showdown-highlight/ |
14 void main() { | 16 void main() { |
15 group('Paragraphs', () { | 17 group('Paragraphs', () { |
16 validate('consecutive lines form a single paragraph', ''' | 18 validate('consecutive lines form a single paragraph', ''' |
17 This is the first line. | 19 This is the first line. |
18 This is the second line. | 20 This is the second line. |
19 ''', ''' | 21 ''', ''' |
20 <p>This is the first line. | 22 <p>This is the first line. |
(...skipping 793 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
814 | 816 |
815 // If one string runs out of non-ignored strings, the other must too. | 817 // If one string runs out of non-ignored strings, the other must too. |
816 if (i == a.length) return j == b.length; | 818 if (i == a.length) return j == b.length; |
817 if (j == b.length) return i == a.length; | 819 if (j == b.length) return i == a.length; |
818 | 820 |
819 if (a[i] != b[j]) return false; | 821 if (a[i] != b[j]) return false; |
820 i++; | 822 i++; |
821 j++; | 823 j++; |
822 } | 824 } |
823 } | 825 } |
OLD | NEW |