|
| 1 | +package org.commonmark.node; |
| 2 | + |
| 3 | +import java.util.Objects; |
| 4 | + |
| 5 | +/** |
| 6 | + * Immutable configuration for limiting node traversal depth. |
| 7 | + * <p> |
| 8 | + * Traversal limits are enforced by {@link AbstractVisitor#visitChildren(Node)} and renderer recursion through the |
| 9 | + * public renderer contexts. Helper traversals outside those entry points need to opt in explicitly. |
| 10 | + */ |
| 11 | +public final class NodeTraversal { |
| 12 | + |
| 13 | + public enum LimitExceededBehavior { |
| 14 | + FAIL_FAST, |
| 15 | + SUCCEED_LOSSY |
| 16 | + } |
| 17 | + |
| 18 | + private static final NodeTraversal UNLIMITED = new NodeTraversal(null, null); |
| 19 | + |
| 20 | + private final Integer maxDepth; |
| 21 | + private final LimitExceededBehavior limitExceededBehavior; |
| 22 | + |
| 23 | + private NodeTraversal(Integer maxDepth, LimitExceededBehavior limitExceededBehavior) { |
| 24 | + this.maxDepth = maxDepth; |
| 25 | + this.limitExceededBehavior = limitExceededBehavior; |
| 26 | + } |
| 27 | + |
| 28 | + public static NodeTraversal unlimited() { |
| 29 | + return UNLIMITED; |
| 30 | + } |
| 31 | + |
| 32 | + public static NodeTraversal failFast(int maxDepth) { |
| 33 | + return limited(maxDepth, LimitExceededBehavior.FAIL_FAST); |
| 34 | + } |
| 35 | + |
| 36 | + public static NodeTraversal succeedLossy(int maxDepth) { |
| 37 | + return limited(maxDepth, LimitExceededBehavior.SUCCEED_LOSSY); |
| 38 | + } |
| 39 | + |
| 40 | + public boolean isUnlimited() { |
| 41 | + return maxDepth == null; |
| 42 | + } |
| 43 | + |
| 44 | + /** |
| 45 | + * @return the inclusive max depth, or {@code null} if this traversal is unlimited |
| 46 | + */ |
| 47 | + public Integer getMaxDepth() { |
| 48 | + return maxDepth; |
| 49 | + } |
| 50 | + |
| 51 | + /** |
| 52 | + * @return the behavior when the depth limit is exceeded, or {@code null} if this traversal is unlimited |
| 53 | + */ |
| 54 | + public LimitExceededBehavior getLimitExceededBehavior() { |
| 55 | + return limitExceededBehavior; |
| 56 | + } |
| 57 | + |
| 58 | + @Override |
| 59 | + public boolean equals(Object o) { |
| 60 | + if (this == o) { |
| 61 | + return true; |
| 62 | + } |
| 63 | + if (!(o instanceof NodeTraversal)) { |
| 64 | + return false; |
| 65 | + } |
| 66 | + NodeTraversal that = (NodeTraversal) o; |
| 67 | + return Objects.equals(maxDepth, that.maxDepth) && limitExceededBehavior == that.limitExceededBehavior; |
| 68 | + } |
| 69 | + |
| 70 | + @Override |
| 71 | + public int hashCode() { |
| 72 | + return Objects.hash(maxDepth, limitExceededBehavior); |
| 73 | + } |
| 74 | + |
| 75 | + @Override |
| 76 | + public String toString() { |
| 77 | + if (isUnlimited()) { |
| 78 | + return "NodeTraversal.unlimited()"; |
| 79 | + } |
| 80 | + return "NodeTraversal." + (limitExceededBehavior == LimitExceededBehavior.FAIL_FAST ? "failFast(" : "succeedLossy(") + maxDepth + ")"; |
| 81 | + } |
| 82 | + |
| 83 | + private static NodeTraversal limited(int maxDepth, LimitExceededBehavior limitExceededBehavior) { |
| 84 | + if (maxDepth < 0) { |
| 85 | + throw new IllegalArgumentException("maxDepth must be >= 0"); |
| 86 | + } |
| 87 | + return new NodeTraversal(maxDepth, Objects.requireNonNull(limitExceededBehavior, "limitExceededBehavior must not be null")); |
| 88 | + } |
| 89 | +} |
0 commit comments