OLD | NEW |
| (Empty) |
1 // Protocol Buffers - Google's data interchange format | |
2 // Copyright 2008 Google Inc. All rights reserved. | |
3 // http://code.google.com/p/protobuf/ | |
4 // | |
5 // Redistribution and use in source and binary forms, with or without | |
6 // modification, are permitted provided that the following conditions are | |
7 // met: | |
8 // | |
9 // * Redistributions of source code must retain the above copyright | |
10 // notice, this list of conditions and the following disclaimer. | |
11 // * Redistributions in binary form must reproduce the above | |
12 // copyright notice, this list of conditions and the following disclaimer | |
13 // in the documentation and/or other materials provided with the | |
14 // distribution. | |
15 // * Neither the name of Google Inc. nor the names of its | |
16 // contributors may be used to endorse or promote products derived from | |
17 // this software without specific prior written permission. | |
18 // | |
19 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
20 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
21 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
22 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
23 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
24 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
25 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
26 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
27 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
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. | |
30 | |
31 package com.google.protobuf.test; | |
32 import com.google.protobuf.*; | |
33 | |
34 import java.io.UnsupportedEncodingException; | |
35 import java.util.Arrays; | |
36 import java.util.Iterator; | |
37 | |
38 /** | |
39 * This class tests {@link RopeByteString} by inheriting the tests from | |
40 * {@link LiteralByteStringTest}. Only a couple of methods are overridden. | |
41 * | |
42 * <p>A full test of the result of {@link RopeByteString#substring(int, int)} is
found in the | |
43 * separate class {@link RopeByteStringSubstringTest}. | |
44 * | |
45 * @author carlanton@google.com (Carl Haverl) | |
46 */ | |
47 public class RopeByteStringTest extends LiteralByteStringTest { | |
48 | |
49 @Override | |
50 protected void setUp() throws Exception { | |
51 classUnderTest = "RopeByteString"; | |
52 referenceBytes = ByteStringTest.getTestBytes(22341, 22337766L); | |
53 Iterator<ByteString> iter = ByteStringTest.makeConcretePieces(referenceBytes
).iterator(); | |
54 stringUnderTest = iter.next(); | |
55 while (iter.hasNext()) { | |
56 stringUnderTest = stringUnderTest.concat(iter.next()); | |
57 } | |
58 expectedHashCode = -1214197238; | |
59 } | |
60 | |
61 public void testBalance() { | |
62 int numberOfPieces = 10000; | |
63 int pieceSize = 64; | |
64 byte[] testBytes = ByteStringTest.getTestBytes(numberOfPieces * pieceSize, 1
13377L); | |
65 | |
66 // Build up a big ByteString from smaller pieces to force a rebalance | |
67 ByteString concatenated = ByteString.EMPTY; | |
68 for (int i = 0; i < numberOfPieces; ++i) { | |
69 concatenated = concatenated.concat(ByteString.copyFrom(testBytes, i * piec
eSize, pieceSize)); | |
70 } | |
71 | |
72 assertEquals(classUnderTest + " from string must have the expected type", | |
73 classUnderTest, getActualClassName(concatenated)); | |
74 assertTrue(classUnderTest + " underlying bytes must match after balancing", | |
75 Arrays.equals(testBytes, concatenated.toByteArray())); | |
76 ByteString testString = ByteString.copyFrom(testBytes); | |
77 assertTrue(classUnderTest + " balanced string must equal flat string", | |
78 concatenated.equals(testString)); | |
79 assertTrue(classUnderTest + " flat string must equal balanced string", | |
80 testString.equals(concatenated)); | |
81 assertEquals(classUnderTest + " balanced string must have same hash code as
flat string", | |
82 testString.hashCode(), concatenated.hashCode()); | |
83 } | |
84 } | |
OLD | NEW |