Examples of org.drools.util.PriorityQueue

org.drools.util.PriorityQueue
Binary heap implementation of Buffer that provides for removal based on Comparator ordering.
The removal order of a binary heap is based on either the natural sort order of its elements or a specified {@linkComparator}. The {@link #remove()}method always returns the first element as determined by the sort order. (The ascendingOrder flag in the constructors can be used to reverse the sort order, in which case {@link #remove()}will always remove the last element.) The removal order is not the same as the order of iteration; elements are returned by the iterator in no particular order.
The {@link #add(Object)}and {@link #remove()}operations perform in logarithmic time. The {@link #get()}operation performs in constant time. All other operations perform in linear time or worse.
Note that this implementation is not synchronized. @author Peter Donald @author Ram Chidambaram @author Michael A. Smith @author Paul Jack @author Stephen Colebourne @author Simon Harris @version $Revision: 1.2 $ $Date: 2004/11/19 02:15:18 $

     */
    public Agenda(WorkingMemoryImpl workingMemory,
                  ConflictResolver conflictResolver)
    {
        this.workingMemory = workingMemory;
        this.activationQueue = new PriorityQueue( conflictResolver );
        this.scheduledItems = new HashMap( );
        this.itemsToRetract = new AgendaItemMap( );
        this.scheduledItemsToRetract = new AgendaItemMap( );


    }

View Full Code Here

    }


    public void setUp()
    {
        conflictResolver = RandomConflictResolver.getInstance( );
        items = new PriorityQueue( conflictResolver );


        brieRule = new InstrumentedRule( "brie" );
        brieRule.isValid( true );


        camembertRule = new InstrumentedRule( "camembert" );

View Full Code Here

    }


    public void setUp()
    {
        conflictResolver = FifoConflictResolver.getInstance( );
        items = new PriorityQueue( conflictResolver );


        brieRule = new InstrumentedRule( "brie" );
        camembertRule = new InstrumentedRule( "camembert" );
        stiltonRule = new InstrumentedRule( "stilton" );

View Full Code Here

    }


    public void setUp()
    {
        this.conflictResolver = PrimacyConflictResolver.getInstance( );
        items = new PriorityQueue( conflictResolver );


        brieRule = new InstrumentedRule( "brie" );
        camembertRule = new InstrumentedRule( "camembert" );
        stiltonRule = new InstrumentedRule( "stilton" );

View Full Code Here

    }


    public void setUp()
    {
        conflictResolver = SimplicityConflictResolver.getInstance( );
        items = new PriorityQueue( conflictResolver );


        brieRule = new InstrumentedRule( "brie" );
        camembertRule = new InstrumentedRule( "camembert" );
        stiltonRule = new InstrumentedRule( "stilton" );

View Full Code Here

    }


    public void setUp()
    {
        conflictResolver = ComplexityConflictResolver.getInstance( );
        items = new PriorityQueue( conflictResolver );


        brieRule = new InstrumentedRule( "brie" );
        camembertRule = new InstrumentedRule( "camembert" );
        stiltonRule = new InstrumentedRule( "stilton" );

View Full Code Here

        
    public ModuleImpl(String name,
                      ConflictResolver conflictResolver)
    {
        this.name = name;
        this.activationQueue = new PriorityQueue( conflictResolver );    
    }

View Full Code Here

    }


    public void setUp()
    {
        this.conflictResolver = RecencyConflictResolver.getInstance( );
        items = new PriorityQueue( conflictResolver );


        brieRule = new InstrumentedRule( "brie" );
        camembertRule = new InstrumentedRule( "camembert" );
        stiltonRule = new InstrumentedRule( "stilton" );

View Full Code Here

    }


    public void setUp() throws Exception
    {
        this.conflictResolver = DefaultConflictResolver.getInstance( );
        items = new PriorityQueue( this.conflictResolver );


        brieRule = new InstrumentedRule( "brie" );
        brieRule.isValid( true );


        camembertRule = new InstrumentedRule( "camembert" );

View Full Code Here

    }


    public void setUp()
    {
        conflictResolver = LifoConflictResolver.getInstance( );
        items = new PriorityQueue( conflictResolver );


        brieRule = new InstrumentedRule( "brie" );
        camembertRule = new InstrumentedRule( "camembert" );
        stiltonRule = new InstrumentedRule( "stilton" );

View Full Code Here

0 1

TOP

Related Classes of org.drools.util.PriorityQueue

org.drools.conflict.ComplexityConflictResolverTest

org.drools.conflict.DefaultConflictResolverTest

org.drools.conflict.FifoConflictResolverTest

org.drools.conflict.LifoConflictResolverTest

org.drools.conflict.LoadOrderConflictResolverTest

org.drools.conflict.PrimacyConflictResolverTest

org.drools.conflict.RandomConflictResolverTest

org.drools.conflict.RecencyConflictResolverTest

org.drools.conflict.SalienceConflictResolverTest

org.drools.conflict.SimplicityConflictResolverTest

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.