-
-
Notifications
You must be signed in to change notification settings - Fork 718
/
Checks.java
236 lines (204 loc) · 8.24 KB
/
Checks.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
/*
* Copyright 2015 Austin Keener, Michael Ritter, Florian Spieß, and the JDA contributors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package net.dv8tion.jda.internal.utils;
import net.dv8tion.jda.api.interactions.components.ActionComponent;
import net.dv8tion.jda.api.interactions.components.LayoutComponent;
import org.jetbrains.annotations.Contract;
import java.util.Collection;
import java.util.Locale;
import java.util.Map;
import java.util.Objects;
import java.util.function.BiFunction;
import java.util.function.Function;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
import java.util.stream.Stream;
public class Checks
{
public static final Pattern ALPHANUMERIC_WITH_DASH = Pattern.compile("[\\w-]+", Pattern.UNICODE_CHARACTER_CLASS);
public static final Pattern ALPHANUMERIC = Pattern.compile("[\\w]+", Pattern.UNICODE_CHARACTER_CLASS);
@Contract("null -> fail")
public static void isSnowflake(final String snowflake)
{
isSnowflake(snowflake, snowflake);
}
@Contract("null, _ -> fail")
public static void isSnowflake(final String snowflake, final String message)
{
notNull(snowflake, message);
if (snowflake.length() > 20 || !Helpers.isNumeric(snowflake))
throw new IllegalArgumentException(message + " is not a valid snowflake value! Provided: \"" + snowflake + "\"");
}
@Contract("false, _ -> fail")
public static void check(final boolean expression, final String message)
{
if (!expression)
throw new IllegalArgumentException(message);
}
@Contract("false, _, _ -> fail")
public static void check(final boolean expression, final String message, final Object... args)
{
if (!expression)
throw new IllegalArgumentException(String.format(message, args));
}
@Contract("false, _, _ -> fail")
public static void check(final boolean expression, final String message, final Object arg)
{
if (!expression)
throw new IllegalArgumentException(String.format(message, arg));
}
@Contract("null, _ -> fail")
public static void notNull(final Object argument, final String name)
{
if (argument == null)
throw new IllegalArgumentException(name + " may not be null");
}
@Contract("null, _ -> fail")
public static void notEmpty(final CharSequence argument, final String name)
{
notNull(argument, name);
if (Helpers.isEmpty(argument))
throw new IllegalArgumentException(name + " may not be empty");
}
@Contract("null, _ -> fail")
public static void notBlank(final CharSequence argument, final String name)
{
notNull(argument, name);
if (Helpers.isBlank(argument))
throw new IllegalArgumentException(name + " may not be blank");
}
@Contract("null, _ -> fail")
public static void noWhitespace(final CharSequence argument, final String name)
{
notNull(argument, name);
if (Helpers.containsWhitespace(argument))
throw new IllegalArgumentException(name + " may not contain blanks. Provided: \"" + argument + "\"");
}
@Contract("null, _ -> fail")
public static void notEmpty(final Collection<?> argument, final String name)
{
notNull(argument, name);
if (argument.isEmpty())
throw new IllegalArgumentException(name + " may not be empty");
}
@Contract("null, _ -> fail")
public static void notEmpty(final Object[] argument, final String name)
{
notNull(argument, name);
if (argument.length == 0)
throw new IllegalArgumentException(name + " may not be empty");
}
@Contract("null, _ -> fail")
public static void noneNull(final Collection<?> argument, final String name)
{
notNull(argument, name);
argument.forEach(it -> notNull(it, name));
}
@Contract("null, _ -> fail")
public static void noneNull(final Object[] argument, final String name)
{
notNull(argument, name);
for (Object it : argument) {
notNull(it, name);
}
}
@Contract("null, _ -> fail")
public static <T extends CharSequence> void noneEmpty(final Collection<T> argument, final String name)
{
notNull(argument, name);
argument.forEach(it -> notEmpty(it, name));
}
@Contract("null, _ -> fail")
public static <T extends CharSequence> void noneBlank(final Collection<T> argument, final String name)
{
notNull(argument, name);
argument.forEach(it -> notBlank(it, name));
}
@Contract("null, _ -> fail")
public static <T extends CharSequence> void noneContainBlanks(final Collection<T> argument, final String name)
{
notNull(argument, name);
argument.forEach(it -> noWhitespace(it, name));
}
public static void inRange(final String input, final int min, final int max, final String name)
{
notNull(input, name);
int length = Helpers.codePointLength(input);
check(min <= length && length <= max,
"%s must be between %d and %d characters long! Provided: \"%s\"",
name, min, max, input);
}
public static void notLonger(final String input, final int length, final String name)
{
notNull(input, name);
check(Helpers.codePointLength(input) <= length, "%s may not be longer than %d characters! Provided: \"%s\"", name, length, input);
}
public static void matches(final String input, final Pattern pattern, final String name)
{
notNull(input, name);
check(pattern.matcher(input).matches(), "%s must match regex ^%s$. Provided: \"%s\"", name, pattern.pattern(), input);
}
public static void isLowercase(final String input, final String name)
{
notNull(input, name);
check(input.toLowerCase(Locale.ROOT).equals(input), "%s must be lowercase only! Provided: \"%s\"", name, input);
}
public static void positive(final int n, final String name)
{
if (n <= 0)
throw new IllegalArgumentException(name + " may not be negative or zero");
}
public static void positive(final long n, final String name)
{
if (n <= 0)
throw new IllegalArgumentException(name + " may not be negative or zero");
}
public static void notNegative(final int n, final String name)
{
if (n < 0)
throw new IllegalArgumentException(name + " may not be negative");
}
public static void notNegative(final long n, final String name)
{
if (n < 0)
throw new IllegalArgumentException(name + " may not be negative");
}
// Unique streams checks
public static <T> void checkUnique(Stream<T> stream, String format, BiFunction<Long, T, Object[]> getArgs)
{
Map<T, Long> counts = stream.collect(Collectors.groupingBy(Function.identity(), Collectors.counting()));
for (Map.Entry<T, Long> entry : counts.entrySet())
{
if (entry.getValue() > 1)
{
Object[] args = getArgs.apply(entry.getValue(), entry.getKey());
throw new IllegalArgumentException(Helpers.format(format, args));
}
}
}
public static void checkDuplicateIds(Stream<? extends LayoutComponent> layouts)
{
Stream<String> stream = layouts.flatMap(row -> row.getComponents().stream())
.filter(ActionComponent.class::isInstance)
.map(ActionComponent.class::cast)
.map(ActionComponent::getId)
.filter(Objects::nonNull);
checkUnique(stream,
"Cannot have components with duplicate custom IDs. Id: \"%s\" appeared %d times!",
(count, value) -> new Object[]{ value, count }
);
}
}