OLD | NEW |
1 // Protocol Buffers - Google's data interchange format | 1 // Protocol Buffers - Google's data interchange format |
2 // Copyright 2008 Google Inc. All rights reserved. | 2 // Copyright 2008 Google Inc. All rights reserved. |
3 // https://developers.google.com/protocol-buffers/ | 3 // https://developers.google.com/protocol-buffers/ |
4 // | 4 // |
5 // Redistribution and use in source and binary forms, with or without | 5 // Redistribution and use in source and binary forms, with or without |
6 // modification, are permitted provided that the following conditions are | 6 // modification, are permitted provided that the following conditions are |
7 // met: | 7 // met: |
8 // | 8 // |
9 // * Redistributions of source code must retain the above copyright | 9 // * Redistributions of source code must retain the above copyright |
10 // notice, this list of conditions and the following disclaimer. | 10 // notice, this list of conditions and the following disclaimer. |
(...skipping 12 matching lines...) Expand all Loading... |
23 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 23 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
24 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 24 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
25 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 25 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
26 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 26 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
27 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 27 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
28 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 28 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
29 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 29 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
30 | 30 |
31 package com.google.protobuf; | 31 package com.google.protobuf; |
32 | 32 |
| 33 import junit.framework.TestCase; |
| 34 |
33 import java.util.Iterator; | 35 import java.util.Iterator; |
34 import java.util.List; | 36 import java.util.List; |
35 import java.util.ListIterator; | 37 import java.util.ListIterator; |
36 import junit.framework.TestCase; | |
37 | 38 |
38 /** | 39 /** |
39 * Tests for {@link UnmodifiableLazyStringList}. | 40 * Tests for {@link UnmodifiableLazyStringList}. |
40 * | 41 * |
41 * @author jonp@google.com (Jon Perlow) | 42 * @author jonp@google.com (Jon Perlow) |
42 */ | 43 */ |
43 public class UnmodifiableLazyStringListTest extends TestCase { | 44 public class UnmodifiableLazyStringListTest extends TestCase { |
44 | 45 |
45 private static String STRING_A = "A"; | 46 private static String STRING_A = "A"; |
46 private static String STRING_B = "B"; | 47 private static String STRING_B = "B"; |
(...skipping 170 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
217 } | 218 } |
218 | 219 |
219 private LazyStringArrayList createSampleList() { | 220 private LazyStringArrayList createSampleList() { |
220 LazyStringArrayList rawList = new LazyStringArrayList(); | 221 LazyStringArrayList rawList = new LazyStringArrayList(); |
221 rawList.add(STRING_A); | 222 rawList.add(STRING_A); |
222 rawList.add(STRING_B); | 223 rawList.add(STRING_B); |
223 rawList.add(STRING_C); | 224 rawList.add(STRING_C); |
224 return rawList; | 225 return rawList; |
225 } | 226 } |
226 } | 227 } |
OLD | NEW |