|
1 | 1 | using NUnit.Framework;
|
2 | 2 | using TagLib;
|
3 | 3 |
|
| 4 | +using File = TagLib.File; |
| 5 | + |
4 | 6 | namespace TaglibSharp.Tests.Collections
|
5 | 7 | {
|
6 | 8 | [TestFixture]
|
@@ -33,127 +35,127 @@ public void RFind ()
|
33 | 35 | {
|
34 | 36 | // file1
|
35 | 37 | var file1 = CreateFile (length1);
|
36 |
| - Assert.AreEqual (-1, file1.RFind (Pattern1)); |
37 |
| - Assert.AreEqual (-1, file1.RFind (Pattern1, 5)); |
| 38 | + ClassicAssert.AreEqual (-1, file1.RFind (Pattern1)); |
| 39 | + ClassicAssert.AreEqual (-1, file1.RFind (Pattern1, 5)); |
38 | 40 |
|
39 | 41 | file1.Insert (Pattern1, 30, 2);
|
40 |
| - Assert.AreEqual (30, file1.RFind (Pattern1)); |
| 42 | + ClassicAssert.AreEqual (30, file1.RFind (Pattern1)); |
41 | 43 |
|
42 | 44 | file1.Insert (Pattern1, length1 / 2, 2);
|
43 |
| - Assert.AreEqual (length1 / 2, file1.RFind (Pattern1)); |
| 45 | + ClassicAssert.AreEqual (length1 / 2, file1.RFind (Pattern1)); |
44 | 46 |
|
45 | 47 | file1.Insert (Pattern1, length1 - 30, 2);
|
46 |
| - Assert.AreEqual (length1 - 30, file1.RFind (Pattern1)); |
| 48 | + ClassicAssert.AreEqual (length1 - 30, file1.RFind (Pattern1)); |
47 | 49 |
|
48 |
| - Assert.AreEqual (30, file1.RFind (Pattern1, length1 - length1 / 2 + 1)); |
49 |
| - Assert.AreEqual (length1 / 2, file1.RFind (Pattern1, 30 + 1)); |
50 |
| - Assert.AreEqual (length1 - 30, file1.RFind (Pattern1, 2 + 1)); |
| 50 | + ClassicAssert.AreEqual (30, file1.RFind (Pattern1, length1 - length1 / 2 + 1)); |
| 51 | + ClassicAssert.AreEqual (length1 / 2, file1.RFind (Pattern1, 30 + 1)); |
| 52 | + ClassicAssert.AreEqual (length1 - 30, file1.RFind (Pattern1, 2 + 1)); |
51 | 53 |
|
52 | 54 |
|
53 | 55 | // file2
|
54 | 56 | var file2 = CreateFile (length2);
|
55 |
| - Assert.AreEqual (-1, file2.RFind (Pattern1)); |
56 |
| - Assert.AreEqual (-1, file2.RFind (Pattern1, 8)); |
| 57 | + ClassicAssert.AreEqual (-1, file2.RFind (Pattern1)); |
| 58 | + ClassicAssert.AreEqual (-1, file2.RFind (Pattern1, 8)); |
57 | 59 |
|
58 | 60 | file2.Insert (Pattern1, 30, Pattern1.Length);
|
59 |
| - Assert.AreEqual (30, file2.RFind (Pattern1)); |
| 61 | + ClassicAssert.AreEqual (30, file2.RFind (Pattern1)); |
60 | 62 |
|
61 | 63 | file2.Insert (Pattern1, length2 / 2, Pattern1.Length);
|
62 |
| - Assert.AreEqual (length2 / 2, file2.RFind (Pattern1)); |
| 64 | + ClassicAssert.AreEqual (length2 / 2, file2.RFind (Pattern1)); |
63 | 65 |
|
64 | 66 | file2.Insert (Pattern1, length2 - 30, Pattern1.Length);
|
65 |
| - Assert.AreEqual (length2 - 30, file2.RFind (Pattern1)); |
| 67 | + ClassicAssert.AreEqual (length2 - 30, file2.RFind (Pattern1)); |
66 | 68 |
|
67 |
| - Assert.AreEqual (30, file2.RFind (Pattern1, length2 - length2 / 2)); |
68 |
| - Assert.AreEqual (length2 / 2, file2.RFind (Pattern1, 30)); |
69 |
| - Assert.AreEqual (length2 - 30, file2.RFind (Pattern1, 2)); |
| 69 | + ClassicAssert.AreEqual (30, file2.RFind (Pattern1, length2 - length2 / 2)); |
| 70 | + ClassicAssert.AreEqual (length2 / 2, file2.RFind (Pattern1, 30)); |
| 71 | + ClassicAssert.AreEqual (length2 - 30, file2.RFind (Pattern1, 2)); |
70 | 72 |
|
71 | 73 |
|
72 | 74 | // file3
|
73 | 75 | // especially used to test searching if the search pattern is splattened to
|
74 | 76 | // different buffer reads
|
75 | 77 | // this test is specialized to the used algorithm
|
76 | 78 | var file3 = CreateFile (length3);
|
77 |
| - Assert.AreEqual (-1, file3.RFind (Pattern1)); |
78 |
| - Assert.AreEqual (-1, file3.RFind (Pattern1, 13)); |
| 79 | + ClassicAssert.AreEqual (-1, file3.RFind (Pattern1)); |
| 80 | + ClassicAssert.AreEqual (-1, file3.RFind (Pattern1, 13)); |
79 | 81 |
|
80 | 82 | long buffer_cross2 = file3.Length - 2 * File.BufferSize - (Pattern1.Length / 2);
|
81 | 83 | file3.Insert (Pattern1, buffer_cross2, Pattern1.Length);
|
82 |
| - Assert.AreEqual (buffer_cross2, file3.RFind (Pattern1)); |
| 84 | + ClassicAssert.AreEqual (buffer_cross2, file3.RFind (Pattern1)); |
83 | 85 |
|
84 | 86 | long buffer_cross1 = file3.Length - File.BufferSize - (Pattern1.Length / 2);
|
85 | 87 | file3.Insert (Pattern1, buffer_cross1, Pattern1.Length);
|
86 |
| - Assert.AreEqual (buffer_cross1, file3.RFind (Pattern1)); |
| 88 | + ClassicAssert.AreEqual (buffer_cross1, file3.RFind (Pattern1)); |
87 | 89 |
|
88 | 90 | // see Find()
|
89 | 91 | long buffer_cross3 = file3.Length - File.BufferSize - Pattern3.Length + 1;
|
90 | 92 | file3.Insert (Pattern3, buffer_cross3 + 1, Pattern3.Length);
|
91 | 93 | file3.Insert (Pattern3, buffer_cross3, Pattern3.Length);
|
92 |
| - Assert.AreEqual (buffer_cross3, file3.RFind (Pattern3)); |
| 94 | + ClassicAssert.AreEqual (buffer_cross3, file3.RFind (Pattern3)); |
93 | 95 | }
|
94 | 96 |
|
95 | 97 | [Test]
|
96 | 98 | public void Find ()
|
97 | 99 | {
|
98 | 100 | // file1
|
99 | 101 | var file1 = CreateFile (length1);
|
100 |
| - Assert.AreEqual (Chars.IndexOf ('U'), file1.Find ((byte)'U')); |
| 102 | + ClassicAssert.AreEqual (Chars.IndexOf ('U'), file1.Find ((byte)'U')); |
101 | 103 |
|
102 |
| - Assert.AreEqual (-1, file1.Find (Pattern1)); |
103 |
| - Assert.AreEqual (-1, file1.Find (Pattern1, 9)); |
| 104 | + ClassicAssert.AreEqual (-1, file1.Find (Pattern1)); |
| 105 | + ClassicAssert.AreEqual (-1, file1.Find (Pattern1, 9)); |
104 | 106 |
|
105 | 107 | file1.Insert (Pattern1, length1 - 30, Pattern1.Length);
|
106 |
| - Assert.AreEqual (length1 - 30, file1.Find (Pattern1)); |
| 108 | + ClassicAssert.AreEqual (length1 - 30, file1.Find (Pattern1)); |
107 | 109 |
|
108 | 110 | file1.Insert (Pattern1, length1 / 2, Pattern1.Length);
|
109 |
| - Assert.AreEqual (length1 / 2, file1.Find (Pattern1)); |
| 111 | + ClassicAssert.AreEqual (length1 / 2, file1.Find (Pattern1)); |
110 | 112 |
|
111 | 113 | file1.Insert (Pattern1, 30, Pattern1.Length);
|
112 |
| - Assert.AreEqual (30, file1.Find (Pattern1)); |
| 114 | + ClassicAssert.AreEqual (30, file1.Find (Pattern1)); |
113 | 115 |
|
114 | 116 |
|
115 | 117 | // file2
|
116 | 118 | var file2 = CreateFile (length2);
|
117 |
| - Assert.AreEqual (Chars.IndexOf ('M'), file2.Find ((byte)'M')); |
| 119 | + ClassicAssert.AreEqual (Chars.IndexOf ('M'), file2.Find ((byte)'M')); |
118 | 120 |
|
119 |
| - Assert.AreEqual (-1, file2.Find (Pattern1)); |
120 |
| - Assert.AreEqual (-1, file2.Find (Pattern1, 3)); |
| 121 | + ClassicAssert.AreEqual (-1, file2.Find (Pattern1)); |
| 122 | + ClassicAssert.AreEqual (-1, file2.Find (Pattern1, 3)); |
121 | 123 |
|
122 | 124 | file2.Insert (Pattern1, length2 - 30, Pattern1.Length);
|
123 |
| - Assert.AreEqual (length2 - 30, file2.Find (Pattern1)); |
| 125 | + ClassicAssert.AreEqual (length2 - 30, file2.Find (Pattern1)); |
124 | 126 |
|
125 | 127 | file2.Insert (Pattern1, length2 / 2, Pattern1.Length);
|
126 |
| - Assert.AreEqual (length2 / 2, file2.Find (Pattern1)); |
| 128 | + ClassicAssert.AreEqual (length2 / 2, file2.Find (Pattern1)); |
127 | 129 |
|
128 | 130 | file2.Insert (Pattern1, 30, Pattern1.Length);
|
129 |
| - Assert.AreEqual (30, file2.Find (Pattern1)); |
| 131 | + ClassicAssert.AreEqual (30, file2.Find (Pattern1)); |
130 | 132 |
|
131 |
| - Assert.AreEqual (30, file2.Find (Pattern1, 2)); |
132 |
| - Assert.AreEqual (length2 / 2, file2.Find (Pattern1, 31)); |
133 |
| - Assert.AreEqual (length2 - 30, file2.Find (Pattern1, length2 / 2 + 3)); |
| 133 | + ClassicAssert.AreEqual (30, file2.Find (Pattern1, 2)); |
| 134 | + ClassicAssert.AreEqual (length2 / 2, file2.Find (Pattern1, 31)); |
| 135 | + ClassicAssert.AreEqual (length2 - 30, file2.Find (Pattern1, length2 / 2 + 3)); |
134 | 136 |
|
135 | 137 | // file3
|
136 | 138 | // especially used to test searching if the search pattern is splattened to
|
137 | 139 | // different buffer reads.
|
138 | 140 | // this test is specialized to the used algorithm
|
139 | 141 | var file3 = CreateFile (length3);
|
140 |
| - Assert.AreEqual (-1, file3.Find (Pattern1)); |
141 |
| - Assert.AreEqual (-1, file3.Find (Pattern1, 13)); |
| 142 | + ClassicAssert.AreEqual (-1, file3.Find (Pattern1)); |
| 143 | + ClassicAssert.AreEqual (-1, file3.Find (Pattern1, 13)); |
142 | 144 |
|
143 | 145 | long buffer_cross2 = 2 * File.BufferSize - (Pattern1.Length / 2);
|
144 | 146 | file3.Insert (Pattern1, buffer_cross2, Pattern1.Length);
|
145 |
| - Assert.AreEqual (buffer_cross2, file3.Find (Pattern1)); |
| 147 | + ClassicAssert.AreEqual (buffer_cross2, file3.Find (Pattern1)); |
146 | 148 |
|
147 | 149 | long buffer_cross1 = File.BufferSize - (Pattern1.Length / 2);
|
148 | 150 | file3.Insert (Pattern1, buffer_cross1, Pattern1.Length);
|
149 |
| - Assert.AreEqual (buffer_cross1, file3.Find (Pattern1)); |
| 151 | + ClassicAssert.AreEqual (buffer_cross1, file3.Find (Pattern1)); |
150 | 152 |
|
151 |
| - Assert.AreEqual (buffer_cross2, file3.Find (Pattern1, buffer_cross1 + 1)); |
| 153 | + ClassicAssert.AreEqual (buffer_cross2, file3.Find (Pattern1, buffer_cross1 + 1)); |
152 | 154 |
|
153 | 155 | long buffer_cross3 = File.BufferSize - 1;
|
154 | 156 | file3.Insert (Pattern3, buffer_cross3 - 1, Pattern3.Length);
|
155 | 157 | file3.Insert (Pattern3, buffer_cross3, Pattern3.Length);
|
156 |
| - Assert.AreEqual (buffer_cross3, file3.Find (Pattern3)); |
| 158 | + ClassicAssert.AreEqual (buffer_cross3, file3.Find (Pattern3)); |
157 | 159 | }
|
158 | 160 | }
|
159 | 161 |
|
|
0 commit comments