Method testRandom

JSAT/test/jsat/utils/FibHeapTest.java:165–254

()

    
    
    @Test
    public void testRandom()
    {
        System.out.println("testRandp,");
        FibHeap<Long> heap = new FibHeap<Long>();
        
        SortedMap<Long, Double> map = new TreeMap<Long, Double>();
        Map<Long, FibHeap.FibNode<Long>> heapNodes = new HashMap<Long, FibHeap.FibNode<Long>>();
        
        Random rand = RandomUtil.getRandom();
        
        for(int trials = 0; trials < 10; trials++)
        for(int maxSize = 1; maxSize < 2000; maxSize*=2)
        {
            while(map.size() < maxSize)
            {
                
                if(map.size() > 0 && rand.nextDouble() < 0.1)
                {//ocasionally remove the min eliment
                    long entry = map.firstKey();
                    double value = map.get(entry);
                    for( Map.Entry<Long, Double> mapEntry : map.entrySet())
                        if(mapEntry.getValue() < value)
                        {
                            entry = mapEntry.getKey();
                            value = mapEntry.getValue();
                        }
                    map.remove(entry);
                    
                    FibHeap.FibNode<Long> min = heap.removeMin();
                    heapNodes.remove(entry);
                    
                    assertEquals(entry, min.value.longValue());
                    assertEquals(value, min.key, 0.0);

                }
                else if(map.size() > 0 && rand.nextDouble() < 0.4)
                {//lest decrease a random key's value
                    long partitioner = rand.nextLong();
                    SortedMap<Long, Double> subMap = map.tailMap(partitioner);
                    
                    long valToDecrease;
                    if(subMap.isEmpty())
                    {
                        subMap = map.headMap(partitioner);
                        valToDecrease = map.lastKey();
                    }
                    else
                    {
                        valToDecrease = map.firstKey();
                    }
                    
                    double newVal = map.get(valToDecrease)/2;
                    map.put(valToDecrease, newVal);
                    heap.decreaseKey(heapNodes.get(valToDecrease), newVal);
                    
                }
                //then add something