Refactor: minor changes for consistency with rest of file

Author: Whathecode

kotlinx.interval.testcases/src/commonMain/kotlin/IntervalTest.kt

@@ -236,14 +236,14 @@ abstract class IntervalTest<T : Comparable<T>, TSize : Comparable<TSize>>(
         val abWithA = createClosedInterval( a, b )
         val abWithoutA = createInterval( a, false, b, true )
         assertEquals(
-            createInterval( a, true, a, true ),
+            createClosedInterval( a, a ),
             (abWithA - abWithoutA).singleOrNull()
         )
 
         val abWithB = createClosedInterval( a, b )
         val abWithoutB = createInterval ( a, true, b, false )
         assertEquals(
-            createInterval( b, true, b, true ),
+            createClosedInterval( b, b ),
             (abWithB - abWithoutB).singleOrNull()
         )
 

kotlinx.interval/src/commonMain/kotlin/Interval.kt

@@ -117,8 +117,8 @@ open class Interval<T : Comparable<T>, TSize : Comparable<TSize>>(
         if ( leftOfCompare > 0 || rightOfCompare < 0 ) return this
 
         // If the interval to subtract starts after the start of this interval, add the remaining lower bound chunk.
-        val startCompare: Int = lowerBound.compareTo( toSubtract.lowerBound )
-        if ( startCompare < 0 || ( startCompare == 0 && isLowerBoundIncluded && !toSubtract.isLowerBoundIncluded ) )
+        val lowerCompare: Int = lowerBound.compareTo( toSubtract.lowerBound )
+        if ( lowerCompare < 0 || ( lowerCompare == 0 && isLowerBoundIncluded && !toSubtract.isLowerBoundIncluded ) )
         {
             val lowerBoundRemnant = Interval(
                 lowerBound, isLowerBoundIncluded,