- storage,
- final IndexRange contentIndexRange) {
+ public MinimalHeadCapacityStrategy(final LinearIndexStorage> storage, final IndexRange contentIndexRange) {
super(storage, contentIndexRange);
}
diff --git a/src/main/java/org/jlib/container/storage/capacity/minimal/MinimalInitialCapacityStrategy.java b/src/main/java/org/jlib/container/storage/capacity/minimal/MinimalInitialCapacityStrategy.java
index 9901a670..1ea64368 100644
--- a/src/main/java/org/jlib/container/storage/capacity/minimal/MinimalInitialCapacityStrategy.java
+++ b/src/main/java/org/jlib/container/storage/capacity/minimal/MinimalInitialCapacityStrategy.java
@@ -29,27 +29,26 @@
import org.jlib.container.storage.capacity.InitialCapacityStrategy;
/**
+ *
* {@link HeadCapacityStrategy} providing just as much head capacity as needed.
*
*
+ * FIXME: fix comment
* Head capacity:
* This {@link CapacityStrategy} analyzes the current head capacity to verify for the requested capacity.
* If the requested head capacity is above the available head capacity,
* the {@link LinearIndexStorage} is requested to re-allocate a capacity higher by the difference between requested and
- * available head capacity. The {@link Item}s are shifted "right" to have exactly the requested head capacity.
+ * available head capacity. The items are shifted "right" to have exactly the requested head capacity.
* The {@link LinearIndexStorage} is always requested to provide an additional capacity even if its tail capacity would
* be sufficient.
*
- * @param -
- * type of the items held in the {@link LinearIndexStorage}
- *
* @author Igor Akkerman
*/
-public class MinimalInitialCapacityStrategy
-
-extends AbstractCapacityStrategy
-
+public class MinimalInitialCapacityStrategy
+extends AbstractCapacityStrategy
implements InitialCapacityStrategy {
- public MinimalInitialCapacityStrategy(final LinearIndexStorage
- storage, final IndexRange contentIndexRange) {
+ public MinimalInitialCapacityStrategy(final LinearIndexStorage> storage, final IndexRange contentIndexRange) {
super(storage, contentIndexRange);
}
diff --git a/src/main/java/org/jlib/container/storage/capacity/minimal/MinimalSplitCapacityStrategy.java b/src/main/java/org/jlib/container/storage/capacity/minimal/MinimalSplitCapacityStrategy.java
index dcb2cd4d..393fceae 100644
--- a/src/main/java/org/jlib/container/storage/capacity/minimal/MinimalSplitCapacityStrategy.java
+++ b/src/main/java/org/jlib/container/storage/capacity/minimal/MinimalSplitCapacityStrategy.java
@@ -26,11 +26,10 @@
import org.jlib.container.storage.IndexRangeOperationDescriptor;
import org.jlib.container.storage.LinearIndexStorage;
-public class MinimalSplitCapacityStrategy
-
-extends AbstractSplitCapacityStrategy
- {
+public class MinimalSplitCapacityStrategy
+extends AbstractSplitCapacityStrategy {
- public MinimalSplitCapacityStrategy(final LinearIndexStorage
- storage,
- final IndexRange contentIndexRange) {
+ public MinimalSplitCapacityStrategy(final LinearIndexStorage> storage, final IndexRange contentIndexRange) {
super(storage, contentIndexRange);
}
diff --git a/src/main/java/org/jlib/container/storage/capacity/minimal/MinimalTailCapacityStrategy.java b/src/main/java/org/jlib/container/storage/capacity/minimal/MinimalTailCapacityStrategy.java
index e23ca5e0..d4291eae 100644
--- a/src/main/java/org/jlib/container/storage/capacity/minimal/MinimalTailCapacityStrategy.java
+++ b/src/main/java/org/jlib/container/storage/capacity/minimal/MinimalTailCapacityStrategy.java
@@ -37,22 +37,18 @@
* This {@link CapacityStrategy} analyzes the current head capacity to verify for the requested capacity.
* If the requested head capacity is above the available head capacity,
* the {@link LinearIndexStorage} is requested to re-allocate a capacity higher by the difference between requested and
- * available head capacity. The {@link Item}s are shifted "right" to have exactly the requested head capacity.
+ * available head capacity. The items are shifted "right" to have exactly the requested head capacity.
* The {@link LinearIndexStorage} is always requested to provide an additional capacity even if its tail capacity would
* be sufficient.
*
*
- * @param -
- * type of the items held in the {@link LinearIndexStorage}
- *
* @author Igor Akkerman
*/
-public class MinimalTailCapacityStrategy
-
-extends AbstractCapacityStrategy
-
+public class MinimalTailCapacityStrategy
+extends AbstractCapacityStrategy
implements TailCapacityStrategy {
- public MinimalTailCapacityStrategy(final LinearIndexStorage
- storage,
- final IndexRange contentIndexRange) {
+ public MinimalTailCapacityStrategy(final LinearIndexStorage> storage, final IndexRange contentIndexRange) {
super(storage, contentIndexRange);
}
diff --git a/src/main/java/org/jlib/container/storage/capacity/package-info.java b/src/main/java/org/jlib/container/storage/capacity/package-info.java
index fcf4ea84..c6aed282 100644
--- a/src/main/java/org/jlib/container/storage/capacity/package-info.java
+++ b/src/main/java/org/jlib/container/storage/capacity/package-info.java
@@ -19,7 +19,6 @@
* limitations under the License.
*/
-
/**
*
* Interfaces for strategies of capacity provision in a