浏览代码

jme3-core: corrections to comments ("bellow" -> "below")

Stephen Gold 4 年之前
父节点
当前提交
70eb9d8d7c

+ 1 - 1
jme3-core/src/main/java/com/jme3/light/SpotLight.java

@@ -168,7 +168,7 @@ public class SpotLight extends Light {
         packedAngleCos = (int) (innerCos * 1000);
         packedAngleCos = (int) (innerCos * 1000);
         
         
         //due to approximations, very close angles can give the same cos
         //due to approximations, very close angles can give the same cos
-        //here we make sure outer cos is bellow inner cos.
+        //here we make sure outer cos is below inner cos.
         if (((int) packedAngleCos) == ((int) (outerAngleCos * 1000))) {
         if (((int) packedAngleCos) == ((int) (outerAngleCos * 1000))) {
             outerAngleCos -= 0.001f;
             outerAngleCos -= 0.001f;
         }
         }

+ 2 - 2
jme3-core/src/main/java/com/jme3/util/ListSort.java

@@ -200,7 +200,7 @@ public class ListSort<T> {
         int remaining = high - low;
         int remaining = high - low;
 
 
         /*
         /*
-         * If array's size is bellow min_size we perform a binary insertion sort 
+         * If array's size is below min_size we perform a binary insertion sort 
          * but first we check if some existing ordered pattern exists to reduce 
          * but first we check if some existing ordered pattern exists to reduce 
          * the size of data to be sorted
          * the size of data to be sorted
          */
          */
@@ -219,7 +219,7 @@ public class ListSort<T> {
         while (remaining != 0) {
         while (remaining != 0) {
             int runLength = getRunLength(array, low, high, comparator);
             int runLength = getRunLength(array, low, high, comparator);
 
 
-            /* if runlength is bellow the threshold we binary sort the remaining 
+            /* if runlength is below the threshold we binary sort the remaining 
              * elements
              * elements
              */
              */
             if (runLength < minLength) {
             if (runLength < minLength) {