Here you can find the source of getLongSpecialCases()
private static long[] getLongSpecialCases()
//package com.java2s; /*/*from w w w. ja v a 2s .co m*/ * Licensed to the Apache Software Foundation (ASF) under one or more * contributor license agreements. See the NOTICE file distributed with * this work for additional information regarding copyright ownership. * The ASF licenses this file to You under the Apache License, Version 2.0 * (the "License"); you may not use this file except in compliance with * the License. You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ public class Main { /** * Testing helper method. * @return an array of long numbers containing corner cases:<ul> * <li>values near the beginning of long range,</li> * <li>values near the end of long range,</li> * <li>values near the beginning of int range,</li> * <li>values near the end of int range,</li> * <li>values near zero</li> * <li>and some randomly distributed values.</li> * </ul> */ private static long[] getLongSpecialCases() { long longs[] = new long[100]; int i = 0; longs[i++] = Long.MAX_VALUE; longs[i++] = Long.MAX_VALUE - 1L; longs[i++] = (long) Integer.MAX_VALUE + 1L; longs[i++] = Integer.MAX_VALUE; longs[i++] = Integer.MAX_VALUE - 1; longs[i++] = 100L; longs[i++] = 101L; longs[i++] = 102L; longs[i++] = 300L; longs[i++] = 567L; for (int j = 0; j < 20; j++) { longs[i++] = j; } for (int j = i - 1; j >= 0; j--) { longs[i++] = longs[j] > 0L ? -longs[j] : Long.MIN_VALUE; } java.util.Random r = new java.util.Random(System.nanoTime()); for (; i < longs.length;) { longs[i++] = r.nextLong(); } return longs; } }