| | |
| | | import java.util.List;
|
| | | import java.util.Map;
|
| | | import java.util.Set;
|
| | | import org.springframework.util.AntPathMatcher;
|
| | | import com.ruoyi.common.constant.Constants;
|
| | | import com.ruoyi.common.core.text.StrFormatter;
|
| | |
|
| | | /**
|
| | |
| | | }
|
| | |
|
| | | /**
|
| | | * 是否为http(s)://开头
|
| | | * |
| | | * @param link 链接
|
| | | * @return 结果
|
| | | */
|
| | | public static boolean ishttp(String link)
|
| | | {
|
| | | return StringUtils.startsWithAny(link, Constants.HTTP, Constants.HTTPS);
|
| | | }
|
| | |
|
| | | /**
|
| | | * 字符串转set
|
| | | *
|
| | | * @param str 字符串
|
| | |
| | | }
|
| | |
|
| | | return list;
|
| | | }
|
| | |
|
| | | /**
|
| | | * 判断给定的set列表中是否包含数组array 判断给定的数组array中是否包含给定的元素value
|
| | | *
|
| | | * @param set 给定的集合
|
| | | * @param array 给定的数组
|
| | | * @return boolean 结果
|
| | | */
|
| | | public static boolean containsAny(Collection<String> collection, String... array)
|
| | | {
|
| | | if (isEmpty(collection) || isEmpty(array))
|
| | | {
|
| | | return false;
|
| | | }
|
| | | else
|
| | | {
|
| | | for (String str : array)
|
| | | {
|
| | | if (collection.contains(str))
|
| | | {
|
| | | return true;
|
| | | }
|
| | | }
|
| | | return false;
|
| | | }
|
| | | }
|
| | |
|
| | | /**
|
| | | * 查找指定字符串是否包含指定字符串列表中的任意一个字符串同时串忽略大小写
|
| | | *
|
| | | * @param cs 指定字符串
|
| | | * @param searchCharSequences 需要检查的字符串数组
|
| | | * @return 是否包含任意一个字符串
|
| | | */
|
| | | public static boolean containsAnyIgnoreCase(CharSequence cs, CharSequence... searchCharSequences)
|
| | | {
|
| | | if (isEmpty(cs) || isEmpty(searchCharSequences))
|
| | | {
|
| | | return false;
|
| | | }
|
| | | for (CharSequence testStr : searchCharSequences)
|
| | | {
|
| | | if (containsIgnoreCase(cs, testStr))
|
| | | {
|
| | | return true;
|
| | | }
|
| | | }
|
| | | return false;
|
| | | }
|
| | |
|
| | | /**
|
| | |
| | | }
|
| | |
|
| | | /**
|
| | | * 驼峰式命名法 例如:user_name->userName
|
| | | * 驼峰式命名法
|
| | | * 例如:user_name->userName
|
| | | */
|
| | | public static String toCamelCase(String s)
|
| | | {
|
| | | if (s == null)
|
| | | {
|
| | | return null;
|
| | | }
|
| | | if (s.indexOf(SEPARATOR) == -1)
|
| | | {
|
| | | return s;
|
| | | }
|
| | | s = s.toLowerCase();
|
| | | StringBuilder sb = new StringBuilder(s.length());
|
| | |
| | | return sb.toString();
|
| | | }
|
| | |
|
| | | /**
|
| | | * 查找指定字符串是否匹配指定字符串列表中的任意一个字符串
|
| | | * |
| | | * @param str 指定字符串
|
| | | * @param strs 需要检查的字符串数组
|
| | | * @return 是否匹配
|
| | | */
|
| | | public static boolean matches(String str, List<String> strs)
|
| | | {
|
| | | if (isEmpty(str) || isEmpty(strs))
|
| | | {
|
| | | return false;
|
| | | }
|
| | | for (String pattern : strs)
|
| | | {
|
| | | if (isMatch(pattern, str))
|
| | | {
|
| | | return true;
|
| | | }
|
| | | }
|
| | | return false;
|
| | | }
|
| | |
|
| | | /**
|
| | | * 判断url是否与规则配置: |
| | | * ? 表示单个字符; |
| | | * * 表示一层路径内的任意字符串,不可跨层级; |
| | | * ** 表示任意层路径;
|
| | | * |
| | | * @param pattern 匹配规则
|
| | | * @param url 需要匹配的url
|
| | | * @return
|
| | | */
|
| | | public static boolean isMatch(String pattern, String url)
|
| | | {
|
| | | AntPathMatcher matcher = new AntPathMatcher();
|
| | | return matcher.match(pattern, url);
|
| | | }
|
| | |
|
| | | @SuppressWarnings("unchecked")
|
| | | public static <T> T cast(Object obj)
|
| | | {
|
| | | return (T) obj;
|
| | | }
|
| | |
|
| | | /**
|
| | | * 数字左边补齐0,使之达到指定长度。注意,如果数字转换为字符串后,长度大于size,则只保留 最后size个字符。
|
| | | * |
| | | * @param num 数字对象
|
| | | * @param size 字符串指定长度
|
| | | * @return 返回数字的字符串格式,该字符串为指定长度。
|
| | | */
|
| | | public static final String padl(final Number num, final int size)
|
| | | {
|
| | | return padl(num.toString(), size, '0');
|
| | | }
|
| | |
|
| | | /**
|
| | | * 字符串左补齐。如果原始字符串s长度大于size,则只保留最后size个字符。
|
| | | * |
| | | * @param s 原始字符串
|
| | | * @param size 字符串指定长度
|
| | | * @param c 用于补齐的字符
|
| | | * @return 返回指定长度的字符串,由原字符串左补齐或截取得到。
|
| | | */
|
| | | public static final String padl(final String s, final int size, final char c)
|
| | | {
|
| | | final StringBuilder sb = new StringBuilder(size);
|
| | | if (s != null)
|
| | | {
|
| | | final int len = s.length();
|
| | | if (s.length() <= size)
|
| | | {
|
| | | for (int i = size - len; i > 0; i--)
|
| | | {
|
| | | sb.append(c);
|
| | | }
|
| | | sb.append(s);
|
| | | }
|
| | | else
|
| | | {
|
| | | return s.substring(len - size, len);
|
| | | }
|
| | | }
|
| | | else
|
| | | {
|
| | | for (int i = size; i > 0; i--)
|
| | | {
|
| | | sb.append(c);
|
| | | }
|
| | | }
|
| | | return sb.toString();
|
| | | }
|
| | | } |