ZhouXY108/hutool
1
0
Fork 0
mirror of https://gitee.com/chinabugotech/hutool.git synced 2025-04-19 03:01:48 +08:00
Code Issues Packages Projects Releases Wiki Activity

remove methods

Browse Source
This commit is contained in:
Looly 2022-10-13 17:30:42 +08:00
parent 0c50dfeed8
commit 5575043ba9
1 changed files with 0 additions and 84 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

84
hutool-core/src/main/java/cn/hutool/core/util/PrimitiveArrayUtil.java
View File

@ -2766,18 +2766,6 @@ public class PrimitiveArrayUtil {
return array;
}
/**
* 检查数组是否升序，即array[i] <= array[i+1]，若传入空数组，则返回false
*
* @param array 数组
* @return 数组是否升序
* @author FengBaoheng
* @since 5.5.2
*/
public static boolean isSorted(final byte[] array) {
return isSortedASC(array);
}
/**
* 检查数组是否升序，即array[i] <= array[i+1]，若传入空数组，则返回false
*
@ -2822,18 +2810,6 @@ public class PrimitiveArrayUtil {
return true;
}
/**
* 检查数组是否升序，即array[i] <= array[i+1]，若传入空数组，则返回false
*
* @param array 数组
* @return 数组是否升序
* @author FengBaoheng
* @since 5.5.2
*/
public static boolean isSorted(final short[] array) {
return isSortedASC(array);
}
/**
* 检查数组是否升序，即array[i] <= array[i+1]，若传入空数组，则返回false
*
@ -2878,18 +2854,6 @@ public class PrimitiveArrayUtil {
return true;
}
/**
* 检查数组是否升序，即array[i] <= array[i+1]，若传入空数组，则返回false
*
* @param array 数组
* @return 数组是否升序
* @author FengBaoheng
* @since 5.5.2
*/
public static boolean isSorted(final char[] array) {
return isSortedASC(array);
}
/**
* 检查数组是否升序，即array[i] <= array[i+1]，若传入空数组，则返回false
*
@ -2934,18 +2898,6 @@ public class PrimitiveArrayUtil {
return true;
}
/**
* 检查数组是否升序，即array[i] <= array[i+1]，若传入空数组，则返回false
*
* @param array 数组
* @return 数组是否升序
* @author FengBaoheng
* @since 5.5.2
*/
public static boolean isSorted(final int[] array) {
return isSortedASC(array);
}
/**
* 检查数组是否升序，即array[i] <= array[i+1]，若传入空数组，则返回false
*
@ -2990,18 +2942,6 @@ public class PrimitiveArrayUtil {
return true;
}
/**
* 检查数组是否升序，即array[i] <= array[i+1]，若传入空数组，则返回false
*
* @param array 数组
* @return 数组是否升序
* @author FengBaoheng
* @since 5.5.2
*/
public static boolean isSorted(final long[] array) {
return isSortedASC(array);
}
/**
* 检查数组是否升序，即array[i] <= array[i+1]，若传入空数组，则返回false
*
@ -3046,18 +2986,6 @@ public class PrimitiveArrayUtil {
return true;
}
/**
* 检查数组是否升序，即array[i] <= array[i+1]，若传入空数组，则返回false
*
* @param array 数组
* @return 数组是否升序
* @author FengBaoheng
* @since 5.5.2
*/
public static boolean isSorted(final double[] array) {
return isSortedASC(array);
}
/**
* 检查数组是否升序，即array[i] <= array[i+1]，若传入空数组，则返回false
*
@ -3102,18 +3030,6 @@ public class PrimitiveArrayUtil {
return true;
}
/**
* 检查数组是否升序，即array[i] <= array[i+1]，若传入空数组，则返回false
*
* @param array 数组
* @return 数组是否升序
* @author FengBaoheng
* @since 5.5.2
*/
public static boolean isSorted(final float[] array) {
return isSortedASC(array);
}
/**
* 检查数组是否升序，即array[i] <= array[i+1]，若传入空数组，则返回false
*