Uses of Class
org.jbehave.core.steps.StepCandidate

Packages that use StepCandidate
org.jbehave.core.steps   
 

Uses of StepCandidate in org.jbehave.core.steps
 

Methods in org.jbehave.core.steps that return types with arguments of type StepCandidate
 List<StepCandidate> StepFinder.collectCandidates(List<CandidateSteps> candidateSteps)
          Collects a list of step candidates from CandidateSteps instances.
 List<StepCandidate> Steps.listCandidates()
           
 List<StepCandidate> CandidateSteps.listCandidates()
          Returns the step candidates that can be matched
 List<StepCandidate> StepFinder.prioritise(String stepAsText, List<StepCandidate> candidates)
          Prioritises the list of step candidates that match a given step.
 List<StepCandidate> StepFinder.PrioritisingStrategy.prioritise(String stepAsString, List<StepCandidate> candidates)
           
 List<StepCandidate> StepFinder.ByPriorityField.prioritise(String stepAsText, List<StepCandidate> candidates)
           
 List<StepCandidate> StepFinder.ByLevenshteinDistance.prioritise(String stepAsText, List<StepCandidate> candidates)
           
 

Method parameters in org.jbehave.core.steps with type arguments of type StepCandidate
 List<Step> StepCandidate.createComposedSteps(String stepAsString, Map<String,String> namedParameters, List<StepCandidate> allCandidates)
           
 List<StepCandidate> StepFinder.prioritise(String stepAsText, List<StepCandidate> candidates)
          Prioritises the list of step candidates that match a given step.
 List<StepCandidate> StepFinder.PrioritisingStrategy.prioritise(String stepAsString, List<StepCandidate> candidates)
           
 List<StepCandidate> StepFinder.ByPriorityField.prioritise(String stepAsText, List<StepCandidate> candidates)
           
 List<StepCandidate> StepFinder.ByLevenshteinDistance.prioritise(String stepAsText, List<StepCandidate> candidates)
           
 

Constructors in org.jbehave.core.steps with parameters of type StepCandidate
Stepdoc(StepCandidate candidate)
           
 



Copyright © 2003-2011. All Rights Reserved.