Package it.unimi.dsi.fastutil.ints

Examples of it.unimi.dsi.fastutil.ints.IntHeapPriorityQueue


      tempSize = Math.max( tempSize, index[ i ].maxCount );
    }

    if ( hasPositions ) position = new int[ estimateForMaxCount ];
    doc = new int[ numIndices ];
    documentQueue = new IntHeapPriorityQueue( numIndices, new DocumentIndexComparator( doc ) );
  }
View Full Code Here


        slot = 0;
        size = 0;

        // heap must have n+1 slots to hold extra item before removing smallest
        heap = new IntHeapPriorityQueue(n + 1, new SlotComparator());

        // item lists are lazy-allocated
    }
View Full Code Here

    private IntHeapPriorityQueue freeList;

    public PackedPreferenceDataBuilder() {
        itemIndex = new MutableIdIndexMapping();
        userIndex = new MutableIdIndexMapping();
        freeList = new IntHeapPriorityQueue();
        allocate(INITIAL_CHUNK_COUNT);
    }
View Full Code Here

TOP

Related Classes of it.unimi.dsi.fastutil.ints.IntHeapPriorityQueue

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.