Apply 3 suggestion(s) to 3 file(s)

theodolite-quarkus/src/main/kotlin/theodolite/strategies/searchstrategy/BinarySearch.kt

@@ -5,7 +5,7 @@ import theodolite.util.LoadDimension
 import theodolite.util.Resource
 
 /**
- *  Binary search-like implementation of determining the smallest suitable number of instances.
+ *  Binary-search-like implementation for determining the smallest suitable number of instances.
  *
  * @param benchmarkExecutor Benchmark executor which runs the individual benchmarks.
  */

theodolite-quarkus/src/main/kotlin/theodolite/strategies/searchstrategy/LinearSearch.kt

@@ -5,7 +5,7 @@ import theodolite.util.LoadDimension
 import theodolite.util.Resource
 
 /**
- *  Linear search-like implementation of determining the smallest suitable number of instances.
+ *  Linear-search-like implementation for determining the smallest suitable number of instances.
  *
  * @param benchmarkExecutor Benchmark executor which runs the individual benchmarks.
  */

theodolite-quarkus/src/main/kotlin/theodolite/util/Resource.kt

@@ -3,7 +3,7 @@ package theodolite.util
 import io.quarkus.runtime.annotations.RegisterForReflection
 
 /**
- * Representation of the resources for a execution of Theodolite.
+ * Representation of the resources for an execution of Theodolite.
  */
 @RegisterForReflection
 data class Resource(private val number: Int, private val type: List<PatcherDefinition>) {