-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStringChecks.java
More file actions
96 lines (78 loc) · 3.79 KB
/
Copy pathStringChecks.java
File metadata and controls
96 lines (78 loc) · 3.79 KB
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
/*
* BSD 2-Clause License
*
* Copyright (c) 2021, Ondrej Fischer
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*/
package fluent.validation;
import fluent.validation.processor.Factory;
import java.util.*;
import java.util.regex.Pattern;
import static fluent.validation.BasicChecks.*;
import static fluent.validation.Transformation.dontTransformNull;
/**
* Factory of ready to use most frequent conditions. There are typical conditions for following categories:
*/
@Factory
public final class StringChecks {
private StringChecks() {}
/* ------------------------------------------------------------------------------------------------------
* String conditions.
* ------------------------------------------------------------------------------------------------------
*/
public static Check<String> equalCaseInsensitiveTo(String expectedValue) {
return expectedValue == null ? sameInstance(null) : check(expectedValue::equalsIgnoreCase, "any case " + expectedValue);
}
public static Check<String> emptyString() {
return nullableCheck(data -> Objects.isNull(data) || data.isEmpty(), "is empty string");
}
public static Check<String> trim(Check<? super String> check) {
return compose(dontTransformNull(String::trim), check);
}
public static Check<String> startsWith(String prefix) {
return check(data -> data.startsWith(prefix), "starts with <" + prefix + ">");
}
public static Check<String> startsCaseInsensitiveWith(String prefix) {
return check(data -> data.toLowerCase().startsWith(prefix.toLowerCase()), "starts with " + prefix);
}
public static Check<String> endsWith(String suffix) {
return check(data -> data.startsWith(suffix), "ends with %s" + suffix);
}
public static Check<String> endsCaseInsensitiveWith(String suffix) {
return check(data -> data.toLowerCase().startsWith(suffix.toLowerCase()), "ends with " + suffix);
}
public static Check<String> contains(String substring) {
return check(data -> data.contains(substring), "contains "+ substring);
}
public static Check<String> containsCaseInsensitive(String substring) {
return check(data -> data.toLowerCase().contains(substring.toLowerCase()), "contains " + substring);
}
public static Check<String> matches(Pattern pattern) {
return check(v -> pattern.matcher(v).find(), "matches /" + pattern + '/');
}
public static Check<String> matchesPattern(String pattern) {
return matches(Pattern.compile(pattern));
}
}