Package com.carrotsearch.hppc

Examples of com.carrotsearch.hppc.XorShiftRandom

321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
     * order of 0xf0-masked integers should be preserved from the input.
     */
    @Test
    public void testMergeSortIsStable()
    {
        final Random rnd = new XorShiftRandom(0xdeadbeef);
        final int [] data = new int [10000];

        for (int i = 0; i < data.length; i++)
            data[i] = rnd.nextInt(0x100);

        int [] order = IndirectSort.mergesort(0, data.length, new IndirectComparator()
        {
            public int compare(int indexA, int indexB)
            {
View Full Code Here
39
40
41
42
43
44
45
46
47
48
49
    protected void setUp() throws Exception
    {
        switch (distribution)
        {
            case RANDOM:
                keys = prepareData(size, new XorShiftRandom(0x11223344));
                break;
            case LINEAR:
                keys = prepareLinear(size);
                break;
            case HIGHBITS:
View Full Code Here
TOP

Related Classes of com.carrotsearch.hppc.XorShiftRandom

  • com.carrotsearch.hppc.caliper.BenchmarkPut
  • com.carrotsearch.hppc.sorting.IndirectSortTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.