LUCENE-4488: ignore this heapdump-producing test case for now

git-svn-id: https://svn.apache.org/repos/asf/lucene/dev/trunk@1399763 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Michael McCandless 2012-10-18 18:18:34 +00:00
parent af5beb9808
commit de400265aa
2 changed files with 4 additions and 0 deletions

View File

@ -400,6 +400,7 @@ public final class Util {
continue; continue;
} }
// nocommit this isn't safe? last path could be rejected?
if (results.size() == topN-1) { if (results.size() == topN-1) {
// Last path -- don't bother w/ queue anymore: // Last path -- don't bother w/ queue anymore:
queue = null; queue = null;

View File

@ -38,6 +38,8 @@ import org.apache.lucene.util.LuceneTestCase.Slow;
import org.apache.lucene.util._TestUtil; import org.apache.lucene.util._TestUtil;
import org.apache.lucene.util.packed.PackedInts.Reader; import org.apache.lucene.util.packed.PackedInts.Reader;
import org.junit.Ignore;
@Slow @Slow
public class TestPackedInts extends LuceneTestCase { public class TestPackedInts extends LuceneTestCase {
public void testBitsRequired() { public void testBitsRequired() {
@ -389,6 +391,7 @@ public class TestPackedInts extends LuceneTestCase {
NOTE: this test allocates 256 MB NOTE: this test allocates 256 MB
*/ */
@Ignore("See LUCENE-4488")
public void testIntOverflow() { public void testIntOverflow() {
int INDEX = (int)Math.pow(2, 30)+1; int INDEX = (int)Math.pow(2, 30)+1;
int BITS = 2; int BITS = 2;