congrats Icon
New! Announcing our next generation AI code completions
Read here
Tabnine Logo
LinkedList.getFirst
Code IndexAdd Tabnine to your IDE (free)

How to use
getFirst
method
in
org.drools.core.util.LinkedList

Best Java code snippets using org.drools.core.util.LinkedList.getFirst (Showing top 20 results out of 315)

origin: org.drools/drools-core

@Test
public void testGetFirst() {
  assertNull( "Empty list should return null on getFirst()",
            this.list.getFirst() );
  this.list.add( this.node1 );
  assertSame( "List should return node1 on getFirst()",
            this.list.getFirst(),
            this.node1 );
  this.list.add( this.node2 );
  assertSame( "List should return node1 on getFirst()",
            this.list.getFirst(),
            this.node1 );
  this.list.add( this.node3 );
  assertSame( "List should return node1 on getFirst()",
            this.list.getFirst(),
            this.node1 );
}
origin: org.drools/drools-core

  protected BetaNodeFieldConstraint[] convertToConstraints(LinkedList list) {
    final BetaNodeFieldConstraint[] array = new BetaNodeFieldConstraint[list.size()];
    int i = 0;
    for ( LinkedListEntry entry = (LinkedListEntry) list.getFirst(); entry != null; entry = (LinkedListEntry) entry.getNext() ) {
      array[i++] = (BetaNodeFieldConstraint) entry.getObject();
    }
    return array;
  }
}
origin: org.drools/drools-core

@Test
public void testRemoveFirst() {
  this.list.add( this.node1 );
  this.list.add( this.node2 );
  this.list.add( this.node3 );
  assertSame( "List should return node1 on getFirst()",
            this.list.getFirst(),
            this.node1 );
  this.list.removeFirst();
  assertSame( "List should return node2 on getFirst()",
            this.list.getFirst(),
            this.node2 );
  this.list.removeFirst();
  assertSame( "List should return node3 on getFirst()",
            this.list.getFirst(),
            this.node3 );
  this.list.removeFirst();
  assertNull( "Empty list should return null on getFirst()",
            this.list.getFirst() );
}
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.drools

public JavaUtilIterator(final LinkedList list,
            final boolean immutable) {
  this.list = list;
  this.nextNode = this.list.getFirst();
  this.immutable = immutable;
}
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.drools

private FieldIndex findFieldIndex(final int index) {
  for ( FieldIndex node = this.hashedFieldIndexes.getFirst(); node != null; node = node.getNext() ) {
    if ( node.getIndex() == index ) {
      return node;
    }
  }
  return null;
}
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.drools

public Activation[] getScheduledActivations() {
  Activation[] scheduledActivations = new Activation[this.scheduledActivations.size()];
  int i = 0;
  for ( ScheduledAgendaItem node = this.scheduledActivations.getFirst(); node != null; node = node.getNext() ) {
    scheduledActivations[i++] = node;
  }
  return scheduledActivations;
}
origin: org.drools/drools-core

          this.node1.getNext() );
assertSame( "First node should be node1",
          this.list.getFirst(),
          this.node1 );
assertSame( "Last node should be node1",
          this.node1 );
assertSame( "First node should be node1",
          this.list.getFirst(),
          this.node1 );
assertSame( "Last node should be node2",
           3 );
assertSame( "First node should be node1",
          this.list.getFirst(),
          this.node1 );
assertSame( "Last node should be node3",
origin: org.drools/drools-compiler

LeftTuple deleteFirst = memory.getSegmentMemory().getStagedLeftTuples().getDeleteFirst();
if ( segmentMemory.getRootNode() instanceof JoinNode ) {
  BetaMemory bm = (BetaMemory) segmentMemory.getNodeMemories().getFirst();
  assertEquals( 0, bm.getLeftTupleMemory().size() );
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.drools

/**
 * An Activation is no longer true so it no longer justifies  any  of the logical facts
 * it logically  asserted. It iterates  over the Activation's LinkedList of DependencyNodes
 * it retrieves the justitication  set for each  DependencyNode's FactHandle and  removes
 * itself. If the Set is empty it retracts the FactHandle from the WorkingMemory.
 *
 * @param activation
 * @param context
 * @param rule
 * @throws FactException
 */
public void removeLogicalDependencies(final Activation activation,
                   final PropagationContext context,
                   final Rule rule) throws FactException {
  final LinkedList<LogicalDependency> list = activation.getLogicalDependencies();
  if ( list == null || list.isEmpty() ) {
    return;
  }
  for ( LogicalDependency node = list.getFirst(); node != null; node = node.getNext() ) {
    removeLogicalDependency( activation, node, context );
  }
}
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.drools

public void removeAllBlockersAndBlocked(DefaultAgenda agenda){
  if ( this.blockers != null ) {
    // Iterate and remove this node's logical dependency list from each of it's blockers
    for ( LinkedListEntry<LogicalDependency> node = blockers.getFirst(); node != null; node = node.getNext() ) {
      LogicalDependency dep = node.getObject();
      dep.getJustifier().getBlocked().remove( dep );                
    }
  }  
  this.blockers = null;
  
  if ( this.blocked != null ) {
    // Iterate and remove this node's logical dependency list from each of it's blocked
    for ( LogicalDependency dep = blocked.getFirst(); dep != null; ) {
      LogicalDependency tmp = dep.getNext();
      removeBlocked( dep );
      AgendaItem justified = ( AgendaItem ) dep.getJustified();
      if ( justified.getBlockers().isEmpty() && justified.isActivated() ) {
        // the match is no longer blocked, so stage it
        agenda.getStageActivationsGroup().addActivation( justified );
      }                
      dep = tmp;
    }
  }
  this.blocked = null;
}

origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.drools

public void cancelRemainingPreviousLogicalDependencies() {
  if ( this.previousJustified != null ) {
    for ( LogicalDependency dep = (LogicalDependency) this.previousJustified.getFirst(); dep != null; dep = (LogicalDependency) dep.getNext() ) {
      this.workingMemory.getTruthMaintenanceSystem().removeLogicalDependency( activation, dep, activation.getPropagationContext() );
    }
  }
  if ( this.previousBlocked != null ) {
    for ( LogicalDependency dep = this.previousBlocked.getFirst(); dep != null; ) {
      LogicalDependency tmp = dep.getNext();
      this.previousBlocked.remove( dep );
      AgendaItem justified = ( AgendaItem ) dep.getJustified();
      justified.getBlockers().remove( dep.getJustifierEntry() );
      if (justified.getBlockers().isEmpty() ) {
        // the match is no longer blocked, so stage it
        ((DefaultAgenda)workingMemory.getAgenda()).getStageActivationsGroup().addActivation( justified );
      }
      dep = tmp;
    }
  }
}
origin: org.drools/drools-reteoo

public void evaluate(KnowledgeHelper knowledgeHelper,
           WorkingMemory workingMemory) {
  LinkedList< LogicalDependency<M>> list = ((DefaultKnowledgeHelper)knowledgeHelper).getpreviousJustified();
  if ( list != null ) {
    for ( SimpleLogicalDependency dep = ( SimpleLogicalDependency ) list.getFirst(); dep != null; dep =  ( SimpleLogicalDependency ) dep.getNext() ){
      knowledgeHelper.insertLogical( dep.getObject(), dep.getMode() );
    }
  }
}
origin: org.drools/drools-reteoo

public void evaluate(KnowledgeHelper knowledgeHelper,
           WorkingMemory workingMemory) {
  LinkedList< LogicalDependency<M>> list = ((DefaultKnowledgeHelper)knowledgeHelper).getpreviousJustified();
  if ( list != null ) {
    for ( SimpleLogicalDependency dep = ( SimpleLogicalDependency ) list.getFirst(); dep != null; dep =  ( SimpleLogicalDependency ) dep.getNext() ){
      knowledgeHelper.insertLogical( dep.getObject(), dep.getMode() );
    }
  }
}
origin: org.drools/drools-reteoo

public void evaluate(KnowledgeHelper knowledgeHelper,
           WorkingMemory workingMemory) {
  LinkedList< LogicalDependency<M>> list = ((DefaultKnowledgeHelper)knowledgeHelper).getpreviousJustified();
  if ( list != null ) {
    for ( SimpleLogicalDependency dep = ( SimpleLogicalDependency ) list.getFirst(); dep != null; dep =  ( SimpleLogicalDependency ) dep.getNext() ){
      knowledgeHelper.insertLogical( dep.getObject(), dep.getMode()  );
    }
  }
}
origin: org.drools/drools-reteoo

public void evaluate(KnowledgeHelper knowledgeHelper,
           WorkingMemory workingMemory) {
  LinkedList< LogicalDependency<M>> list = ((DefaultKnowledgeHelper)knowledgeHelper).getpreviousJustified();
  if ( list != null ) {
    for ( SimpleLogicalDependency dep = ( SimpleLogicalDependency ) list.getFirst(); dep != null; dep =  ( SimpleLogicalDependency ) dep.getNext() ){
      knowledgeHelper.insertLogical( dep.getObject(), dep.getMode() );
    }
  }
}
origin: org.drools/drools-reteoo

public void evaluate(KnowledgeHelper knowledgeHelper,
           WorkingMemory workingMemory) {
  LinkedList<LogicalDependency<M>> list = ((DefaultKnowledgeHelper) knowledgeHelper).getpreviousJustified();
  if (list != null) {
    for (SimpleLogicalDependency dep = (SimpleLogicalDependency ) list.getFirst(); dep != null; dep =  ( SimpleLogicalDependency ) dep.getNext() ){
      knowledgeHelper.insertLogical( dep.getObject(), dep.getMode() );
    }
  }
}
origin: org.drools/drools-reteoo

public void evaluate(KnowledgeHelper knowledgeHelper,
           WorkingMemory workingMemory) {
  LinkedList< LogicalDependency<M>> list = ((DefaultKnowledgeHelper)knowledgeHelper).getpreviousJustified();
  if ( list != null ) {
    for ( SimpleLogicalDependency dep = ( SimpleLogicalDependency ) list.getFirst(); dep != null; dep =  ( SimpleLogicalDependency ) dep.getNext() ){
      knowledgeHelper.insertLogical( dep.getObject(), dep.getMode() );
    }
  }
}
origin: org.drools/drools-reteoo

public void evaluate(KnowledgeHelper knowledgeHelper,
           WorkingMemory workingMemory) {
  LinkedList< LogicalDependency<M>> list = ((DefaultKnowledgeHelper)knowledgeHelper).getpreviousJustified();
  if ( list != null ) {
    for ( SimpleLogicalDependency dep = ( SimpleLogicalDependency ) list.getFirst(); dep != null; dep =  ( SimpleLogicalDependency ) dep.getNext() ){
      knowledgeHelper.insertLogical( dep.getObject(), dep.getMode() );
    }
  }
}
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.drools

public void unblockAllActivations(org.drools.runtime.rule.Activation act) {
  AgendaItem targetMatch = ( AgendaItem ) act;
  boolean wasBlocked = (targetMatch.getBlockers() != null && !targetMatch.getBlockers().isEmpty() );
  for ( LinkedListEntry entry = ( LinkedListEntry ) targetMatch.getBlockers().getFirst(); entry != null;  ) {
    LinkedListEntry tmp = ( LinkedListEntry ) entry.getNext();
    LogicalDependency dep = ( LogicalDependency ) entry.getObject();
    ((AgendaItem)dep.getJustifier()).removeBlocked( dep );
    entry = tmp;
  }
  if ( wasBlocked ) {
    // the match is no longer blocked, so stage it
    ((DefaultAgenda)workingMemory.getAgenda()).getStageActivationsGroup().addActivation( targetMatch );
  }
}
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.drools

public void addBlocked(final LogicalDependency dep) {
  // Adds the blocked to the blockers list
  if ( this.blocked == null ) {
    this.blocked = new LinkedList<LogicalDependency>();
  }
  this.blocked.add( dep );
  // now ad the blocker to the blocked's list - we need to check that references are null first
  AgendaItem blocked = (AgendaItem)dep.getJustified();
  if ( blocked.blockers == null ) {
    blocked.blockers = new LinkedList<LinkedListEntry<LogicalDependency>>();
    blocked.blockers.add( dep.getJustifierEntry() );
  } else if ( dep.getJustifierEntry().getNext() == null && dep.getJustifierEntry().getPrevious() == null && blocked.getBlockers().getFirst() != dep.getJustifierEntry() ) {
    blocked.blockers.add( dep.getJustifierEntry() );
  }
}

org.drools.core.utilLinkedListgetFirst

Javadoc

Return the first node in the list

Popular methods of LinkedList

  • size
  • <init>
    Construct an empty LinkedList
  • add
    Add a LinkedListNode to the list. If the LinkedList is empty then the first and last nodes are set t
  • clear
    Iterates the list removing all the nodes until there are no more nodes to remove.
  • isEmpty
  • remove
    Removes a LinkedListNode from the list. This works by attach the previous reference to the child ref
  • removeFirst
    Remove the first node from the list. The next node then becomes the first node. If this is the last
  • removeLast
    Remove the last node from the list. The previous node then becomes the last node. If this is the las
  • get
  • getLast
    Return the last node in the list
  • insertAfter
  • iterator
  • insertAfter,
  • iterator,
  • javaUtilIterator

Popular in Java

  • Running tasks concurrently on multiple threads
  • getApplicationContext (Context)
  • setRequestProperty (URLConnection)
  • compareTo (BigDecimal)
  • Font (java.awt)
    The Font class represents fonts, which are used to render text in a visible way. A font provides the
  • SocketException (java.net)
    This SocketException may be thrown during socket creation or setting options, and is the superclass
  • Format (java.text)
    The base class for all formats. This is an abstract base class which specifies the protocol for clas
  • Properties (java.util)
    A Properties object is a Hashtable where the keys and values must be Strings. Each property can have
  • ResourceBundle (java.util)
    ResourceBundle is an abstract class which is the superclass of classes which provide Locale-specifi
  • Callable (java.util.concurrent)
    A task that returns a result and may throw an exception. Implementors define a single method with no
  • Top 15 Vim Plugins
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimAtomGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyStudentsTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now