Check whether at least one stop criterion is satisfied.

@return <code>true</code> if a stop condition is satisfied
494785
public boolean stopCriterionSatisfied(){
        int i = 0;
        while (i < stopCriteria.size() && !stopCriteria.get(i).searchShouldStop(search)) {
            i++;
        }
        return i < stopCriteria.size();
    }
174769
public boolean isValid() {
        boolean valid = true;
        for (PolylineMarkers polyline : polylineMarkers) {
            valid = polyline.isValid();
            if (!valid) {
                break;
            }
        }
        return valid;
    }
84975
def _check_stop_conditions(self, sensor_graph):
        

        for stop in self.stop_conditions:
            if stop.should_stop(self.tick_count, self.tick_count - self._start_tick, sensor_graph):
                return True

        return False
352366
@Override
    public final boolean satisfiedForFlowOrdering(FilterOutcomes outcomes) {
        if (isAlwaysSatisfiedRequirement()) {
            return true;
        }

        final ComponentRequirement componentRequirement = _hasComponentRequirement.getComponentRequirement();
        if (componentRequirement == null) {
            return true;
        }
        return componentRequirement.isSatisfied(null, outcomes);
    }
807728
public boolean isAbsolute() {
		final int start = hasWindowsDrive(uri.getPath(), true) ? 3 : 0;
		return uri.getPath().startsWith(SEPARATOR, start);
	}
220753
private void checkFinishedPartitions() {

        List<String> failingPartitionSeen = new ArrayList<String>();
        boolean stoppedPartitionSeen = false;

        for (PartitionReplyMsg replyMsg : finishedWork) {
            BatchStatus batchStatus = replyMsg.getBatchStatus();

            if (logger.isLoggable(Level.FINE)) {
                logger.fine("For partitioned step: " + getStepName() + ", the partition # " +
                            replyMsg.getPartitionPlanConfig().getPartitionNumber() + " ended with status '" + batchStatus);
            }

            // Keep looping, just to see the log messages perhaps.
            if (batchStatus.equals(BatchStatus.FAILED)) {

                String msg = "For partitioned step: " + getStepName() + ", the partition # " +
                             replyMsg.getPartitionPlanConfig().getPartitionNumber() + " ended with status '" + batchStatus;
                failingPartitionSeen.add(msg);
            }
            // This code seems to suggest it might be valid for a partition to end up in STOPPED state without
            // the "top-level" step having been aware of this.   It's unclear from the spec if this is even possible
            // or a desirable spec interpretation.  Nevertheless, we'll code it as such noting the ambiguity.
            //
            // However, in the RI at least, we won't bother updating the step level BatchStatus, since to date we
            // would only transition the status in such a way independently.
            if (batchStatus.equals(BatchStatus.STOPPED)) {
                stoppedPartitionSeen = true;
            }
        }

        if (!failingPartitionSeen.isEmpty()) {
            markStepForFailure();
            rollbackPartitionedStep();
            throw new BatchContainerRuntimeException("One or more partitions failed: " + failingPartitionSeen);
        } else if (isStoppingStoppedOrFailed()) {
            rollbackPartitionedStep();
        } else if (stoppedPartitionSeen) {

            // At this point, the top-level job is still running.
            // If we see a stopped partition, we mark the step/job failed
            markStepForFailure();
            rollbackPartitionedStep();
        } else {
            // Call before completion
            if (this.partitionReducerProxy != null) {
                this.partitionReducerProxy.beforePartitionedStepCompletion();
            }
        }

    }
777682
public boolean satisfy(SIMPMessage msg)
  {
    if (TraceComponent.isAnyTracingEnabled() && tc.isEntryEnabled())
      SibTr.entry(tc, "satisfy");

    if (expiryHandle != null)
      expiryHandle.cancel();
    if (!expired)
    {
      satisfied = true;
      this.msg = msg;
      
      if (TraceComponent.isAnyTracingEnabled() && UserTrace.tc_mt.isDebugEnabled())    
        SibTr.debug(UserTrace.tc_mt,       
           nls_mt.getFormattedMessage(
           "REMOTE_REQUEST_SATISFIED_CWSJU0032",
           new Object[] {
             Long.valueOf(tick),
             msg},
           null));
    }

    if (TraceComponent.isAnyTracingEnabled() && tc.isEntryEnabled())
      SibTr.exit(tc, "satisfy", new Boolean(satisfied));

    return satisfied;
  }
1148889
public boolean isRangeSet() {
		for (int i = 0; i < getDimensions(); i++) {
			if( valueMin[i] == 0 && valueMax[i] == 0 ) {
				return false;
			}
		}

		return true;
	}
230958
@Override
	public boolean isInstantiated() {
		if (getPotentialNodes().size() != getMandatoryNodes().size()) {
			return false;
		}
		ISet suc;
		for (int i : getUB().getNodes()) {
			suc = UB.getSuccOrNeighOf(i);
			if (suc.size() != getLB().getSuccOrNeighOf(i).size()) {
				return false;
			}
		}
		return true;
	}
1212477
public boolean satisfied( PropertySet properties)
    {
    boolean isSatisfied;
    Iterator<ICondition> conditions;
    
    for( conditions = getConditions(),
           isSatisfied = true;
           

         isSatisfied
           && conditions.hasNext();

         isSatisfied = !conditions.next().satisfied( properties));
    
    return isSatisfied;
    }
1062305
public boolean checkCondition() {

        // assure that the checkinterval is elapsed .....
        if (super.checkCondition()) {
            return true;
        }

        if (this.watchdogReference.isStale()) {
            return false;
        }

        Watchdog wd = this.watchdogReference.getWatchdog();

        //log.info("Checking "+this+"\n watched WD is alive="+watchedWatchdog.isAlive()+" is killed="+watchedWatchdog.isKilled()+" WD-Thead="+this.watchedWatchdog.getThreadHandle());
        if (!wd.isAlive()) {
            if (log.isInfoEnabled()) {
                String logString = "RestartCondition :: Watchdog " + wd.getThreadHandle() + " is not alive ";
                log.info(new CheckConditionFailedLog(this, logString).toString());
            }
            return false;
        }
        return true;
    }
135269
@Pure
	public boolean isEndingBusHalt() {
		final BusItinerary itinerary = getContainer();
		if (itinerary != null && itinerary.isValidPrimitive()) {
			final int count = itinerary.getValidBusHaltCount();
			if (count > 0) {
				try {
					return itinerary.getBusHaltAt(count - 1) == this;
				} catch (IndexOutOfBoundsException exception) {
					// invalid halt
				}
			}
		}
		return false;
	}
1059504
boolean isDeadEnd()
    {
        if (isAccepting())
        {
            return false;
        }
        for (Transition<DFAState<T>> next : transitions.values())
        {
            if (next.getTo() != this)
            {
                return false;
            }
        }
        return true;
    }
983046
public boolean isFullRevision()
	{
		if (this.parts.size() == 1) {
			DiffPart p = this.parts.get(0);
			if (p.getAction() == DiffAction.FULL_REVISION_UNCOMPRESSED) {
				return true;
			}
		}

		return false;
	}
1038067
public boolean isPathAbsolute() {
    int start = hasWindowsDrive(mUri.getPath(), true) ? 3 : 0;
    return mUri.getPath().startsWith(SEPARATOR, start);
  }
300464
@Override
	public ESat isEntailed() {
		for (int i : loops.getLB()) {
			if (!g.getPotSuccOrNeighOf(i).contains(i)) {
				return ESat.FALSE;
			}
		}
		for (int i : g.getMandatoryNodes()) {
			if (g.getMandSuccOrNeighOf(i).contains(i) && !loops.getUB().contains(i)) {
				return ESat.FALSE;
			}
		}
		if (isCompletelyInstantiated()) {
			return ESat.TRUE;
		}
		return ESat.UNDEFINED;
	}
576364
public boolean isFinished() {
    // If we have a HandshakeResult, we are done.
    if (result != null) {
      return true;
    }
    // If we have an error status, we are done.
    if (status != null && status.getCode() != Status.Code.OK.value()) {
      return true;
    }
    return false;
  }