| Package | Description |
|---|---|
| org.evosuite.continuous.job | |
| org.evosuite.continuous.job.schedule |
| Modifier and Type | Method and Description |
|---|---|
JobDefinition |
JobDefinition.getByAddingBudget(int moreSeconds)
Create a copy of this job by adding extra seconds
|
JobDefinition |
JobDefinition.getByAddingDependencies(Set<String> inputs,
Set<String> parents)
Create a copy of this job, and add the input and parent dependencies to
the set of CUT dependencies
|
JobDefinition |
JobExecutor.pollJob() |
| Modifier and Type | Method and Description |
|---|---|
List<JobDefinition> |
JobScheduler.createNewSchedule()
Return new schedule, or
null if scheduling is finished |
| Modifier and Type | Method and Description |
|---|---|
boolean |
JobDefinition.dependOn(JobDefinition other)
Does the execution of this job depend on the other?
|
void |
JobExecutor.doneWithJob(JobDefinition job) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
JobDefinition.areDependenciesSatisfied(List<JobDefinition> schedule,
Set<String> done)
Check if all jobs this one depends on are finished
|
protected long |
JobExecutor.execute(List<JobDefinition> jobs) |
void |
JobExecutor.executeJobs(List<JobDefinition> jobs,
int cores)
Do a separate search with EvoSuite for all jobs in the given list.
|
protected void |
JobExecutor.initExecution(List<JobDefinition> jobs) |
| Modifier and Type | Method and Description |
|---|---|
protected List<JobDefinition> |
SeedingSchedule.addDepenciesAndSort(List<JobDefinition> jobs) |
protected List<JobDefinition> |
SeedingSchedule.addDependenciesForSeeding(List<JobDefinition> jobs)
For each input job, identify all the others jobs we want to generate
test cases first.
|
abstract List<JobDefinition> |
ScheduleType.createNewSchedule()
Create a new partial/complete schedule if there is still search budget left
|
List<JobDefinition> |
OneTimeSchedule.createNewSchedule() |
protected List<JobDefinition> |
SeedingSchedule.createScheduleForWhenNotEnoughBudget() |
protected List<JobDefinition> |
ScheduleType.createScheduleForWhenNotEnoughBudget()
if there is not enough search budget, then try
to target as many CUTs as possible
|
protected List<JobDefinition> |
SimpleSchedule.createScheduleOnce() |
protected List<JobDefinition> |
SeedingSchedule.createScheduleOnce() |
protected abstract List<JobDefinition> |
OneTimeSchedule.createScheduleOnce() |
protected List<JobDefinition> |
HistorySchedule.createScheduleOnce() |
protected List<JobDefinition> |
BudgetSchedule.createScheduleOnce() |
protected static List<JobDefinition> |
SeedingSchedule.getSortedToSatisfyDependencies(List<JobDefinition> jobs)
Try (best effort) to sort the jobs in a way in which dependent jobs
are executed first.
|
| Modifier and Type | Method and Description |
|---|---|
protected List<JobDefinition> |
SeedingSchedule.addDepenciesAndSort(List<JobDefinition> jobs) |
protected List<JobDefinition> |
SeedingSchedule.addDependenciesForSeeding(List<JobDefinition> jobs)
For each input job, identify all the others jobs we want to generate
test cases first.
|
protected void |
OneTimeSchedule.distributeExtraBudgetEvenly(List<JobDefinition> jobs,
int totalLeftOver,
int maximumBudgetPerCore) |
protected static List<JobDefinition> |
SeedingSchedule.getSortedToSatisfyDependencies(List<JobDefinition> jobs)
Try (best effort) to sort the jobs in a way in which dependent jobs
are executed first.
|
Copyright © 2010–2016 EvoSuite. All rights reserved.