honeymoose
/
OpenSearch
mirror of https://github.com/honeymoose/OpenSearch.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

ensure we exceed 65k in size sometimes in test

This commit is contained in:
Robert Muir 2014-08-07 18:40:47 -04:00
parent 59aabf30f8
commit 87670c613f
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
src/test/java/org/elasticsearch/common/compress/CompressedStreamTests.java
View File

@ -65,8 +65,8 @@ public class CompressedStreamTests extends ElasticsearchTestCase {
public void testRepetitionsL() throws IOException {
Random r = getRandom();
for (int i = 0; i < 1000; i++) {
int numLongs = TestUtil.nextInt(r, 1, 1000);
for (int i = 0; i < 200; i++) {
int numLongs = TestUtil.nextInt(r, 1, 10000);
ByteArrayOutputStream bos = new ByteArrayOutputStream();
long theValue = r.nextLong();
for (int j = 0; j < numLongs; j++) {
@ -88,8 +88,8 @@ public class CompressedStreamTests extends ElasticsearchTestCase {
public void testRepetitionsI() throws IOException {
Random r = getRandom();
for (int i = 0; i < 1000; i++) {
int numInts = TestUtil.nextInt(r, 1, 1000);
for (int i = 0; i < 200; i++) {
int numInts = TestUtil.nextInt(r, 1, 20000);
ByteArrayOutputStream bos = new ByteArrayOutputStream();
int theValue = r.nextInt();
for (int j = 0; j < numInts; j++) {
@ -107,8 +107,8 @@ public class CompressedStreamTests extends ElasticsearchTestCase {
public void testRepetitionsS() throws IOException {
Random r = getRandom();
for (int i = 0; i < 1000; i++) {
int numShorts = TestUtil.nextInt(r, 1, 1000);
for (int i = 0; i < 200; i++) {
int numShorts = TestUtil.nextInt(r, 1, 40000);
ByteArrayOutputStream bos = new ByteArrayOutputStream();
short theValue = (short) r.nextInt(65535);
for (int j = 0; j < numShorts; j++) {