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 #import('../../lib/dartdoc/markdown.dart'); | 8 #import('../../lib/dartdoc/markdown.dart'); |
9 | 9 |
10 // TODO(rnystrom): Better path to unittest. | 10 // TODO(rnystrom): Better path to unittest. |
11 #import('../../lib/unittest/unittest.dart'); | 11 #import('../../pkg/unittest/unittest.dart'); |
12 #import('test_utils.dart'); | 12 #import('test_utils.dart'); |
13 | 13 |
14 /// Most of these tests are based on observing how showdown behaves: | 14 /// Most of these tests are based on observing how showdown behaves: |
15 /// http://softwaremaniacs.org/playground/showdown-highlight/ | 15 /// http://softwaremaniacs.org/playground/showdown-highlight/ |
16 void main() { | 16 void main() { |
17 group('Paragraphs', () { | 17 group('Paragraphs', () { |
18 validate('consecutive lines form a single paragraph', ''' | 18 validate('consecutive lines form a single paragraph', ''' |
19 This is the first line. | 19 This is the first line. |
20 This is the second line. | 20 This is the second line. |
21 ''', ''' | 21 ''', ''' |
(...skipping 766 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
788 | 788 |
789 // If one string runs out of non-ignored strings, the other must too. | 789 // If one string runs out of non-ignored strings, the other must too. |
790 if (i == a.length) return j == b.length; | 790 if (i == a.length) return j == b.length; |
791 if (j == b.length) return i == a.length; | 791 if (j == b.length) return i == a.length; |
792 | 792 |
793 if (a[i] != b[j]) return false; | 793 if (a[i] != b[j]) return false; |
794 i++; | 794 i++; |
795 j++; | 795 j++; |
796 } | 796 } |
797 } | 797 } |
OLD | NEW |