• 判断参数是否符合要求的一个类


    import java.util.Collection;
    
    public class Args {
    
        public static void check(final boolean expression, final String message) {
            if (!expression) {
                throw new IllegalArgumentException(message);
            }
        }
    
        public static void check(final boolean expression, final String message, final Object... args) {
            if (!expression) {
                throw new IllegalArgumentException(String.format(message, args));
            }
        }
    
        public static <T> T notNull(final T argument, final String name) {
            if (argument == null) {
                throw new IllegalArgumentException(name + " may not be null");
            }
            return argument;
        }
    
        public static <T extends CharSequence> T notEmpty(final T argument, final String name) {
            if (argument == null) {
                throw new IllegalArgumentException(name + " may not be null");
            }
            if (TextUtils.isEmpty(argument)) {
                throw new IllegalArgumentException(name + " may not be empty");
            }
            return argument;
        }
    
        public static <T extends CharSequence> T notBlank(final T argument, final String name) {
            if (argument == null) {
                throw new IllegalArgumentException(name + " may not be null");
            }
            if (TextUtils.isBlank(argument)) {
                throw new IllegalArgumentException(name + " may not be blank");
            }
            return argument;
        }
    
        public static <E, T extends Collection<E>> T notEmpty(final T argument, final String name) {
            if (argument == null) {
                throw new IllegalArgumentException(name + " may not be null");
            }
            if (argument.isEmpty()) {
                throw new IllegalArgumentException(name + " may not be empty");
            }
            return argument;
        }
    
        public static int positive(final int n, final String name) {
            if (n <= 0) {
                throw new IllegalArgumentException(name + " may not be negative or zero");
            }
            return n;
        }
    
        public static long positive(final long n, final String name) {
            if (n <= 0) {
                throw new IllegalArgumentException(name + " may not be negative or zero");
            }
            return n;
        }
    
        public static int notNegative(final int n, final String name) {
            if (n < 0) {
                throw new IllegalArgumentException(name + " may not be negative");
            }
            return n;
        }
    
        public static long notNegative(final long n, final String name) {
            if (n < 0) {
                throw new IllegalArgumentException(name + " may not be negative");
            }
            return n;
        }
    
    }
  • 相关阅读:
    P3193 [HNOI2008]GT考试(KMP+矩阵乘法加速dp)
    P2606 [ZJOI2010]排列计数
    洛谷P2657 [SCOI2009]windy数
    P2602 [ZJOI2010]数字计数(递推)
    洛谷 P1073 最优贸易
    [一本通学习笔记] 字典树与 0-1 Trie
    [一本通学习笔记] KMP算法
    [一本通学习笔记] 字符串哈希
    [一本通学习笔记] 广度优先搜索和优化
    [一本通学习笔记] 深度优先搜索与剪枝
  • 原文地址:https://www.cnblogs.com/softidea/p/3334379.html
Copyright © 2020-2023  润新知