导航菜单

页面标题

页面副标题

Spermatid Pro v6.4.3 - j.java 源代码

正在查看: Spermatid Pro v6.4.3 应用的 j.java JAVA 源代码文件

本页面展示 JAVA 反编译生成的源代码文件,支持语法高亮显示。 仅供安全研究与技术分析使用,严禁用于任何非法用途。请遵守相关法律法规。


package nc;

import java.util.ArrayList;
import java.util.EnumSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.TreeSet;
import java.util.function.Consumer;
import oc.o;
import org.checkerframework.com.github.javaparser.JavaToken;
import org.checkerframework.com.github.javaparser.ParseException;
import org.checkerframework.com.github.javaparser.Token;
import org.checkerframework.com.github.javaparser.ast.Modifier;
import org.checkerframework.com.github.javaparser.ast.Node;
import org.checkerframework.com.github.javaparser.ast.expr.f;
import org.checkerframework.com.github.javaparser.ast.expr.k;
import org.checkerframework.com.github.javaparser.ast.expr.l;
import org.checkerframework.com.github.javaparser.ast.expr.y;
import org.checkerframework.com.github.javaparser.ast.type.ArrayType;
import org.checkerframework.com.github.javaparser.ast.type.g;
import org.checkerframework.com.github.javaparser.d;
import pc.m;
import qc.c;
import vc.p;

public abstract class j {
    public List<n0> b = new ArrayList();

    public boolean f2941c;

    public void p(Node node, Node node2, Node node3) {
        if (((s0) node.l().get()).d().equals(((s0) node3.l().get()).d())) {
            v(node3, node2);
        }
    }

    public void A(d dVar) {
        b(dVar);
        this.b = new ArrayList();
        l().O();
    }

    public void B(boolean z) {
        this.f2941c = z;
        l().P(z);
    }

    public void C(int i) {
        D().j(i);
    }

    public abstract JavaToken D();

    public s0 E() {
        if (this.f2941c) {
            return new s0(D(), D());
        }
        return null;
    }

    public abstract void b(d dVar);

    public <T> List<T> c(List<T> list, T t2) {
        if (list == null) {
            list = new LinkedList<>();
        }
        list.add(t2);
        return list;
    }

    public <T extends Node> o<T> d(o<T> oVar, T t2) {
        if (oVar == null) {
            oVar = new o<>();
        }
        oVar.f(t2);
        return oVar;
    }

    public void e(EnumSet<Modifier> enumSet, Modifier modifier) {
        if (enumSet.contains(modifier)) {
            f("Duplicated modifier");
        }
        enumSet.add(modifier);
    }

    public void f(String str) {
        this.b.add(new n0(str, E(), (Throwable) null));
    }

    public <T extends Node> o<T> g(o<T> oVar, T t2) {
        return t2 == null ? oVar : d(oVar, t2);
    }

    public <T extends Node> o<T> h() {
        return new o<>();
    }

    public l i(l lVar, p pVar) {
        org.checkerframework.com.github.javaparser.ast.expr.p pVar2;
        if (lVar instanceof k) {
            pVar2 = new org.checkerframework.com.github.javaparser.ast.expr.p(y(lVar, pVar), d(new o(), new m((s0) lVar.l().orElse(null), EnumSet.noneOf(Modifier.class), new o(), new g(), false, new o(), ((k) lVar).t0().getName())), pVar, true);
        } else {
            if (!(lVar instanceof y)) {
                if (lVar instanceof org.checkerframework.com.github.javaparser.ast.expr.p) {
                    ((org.checkerframework.com.github.javaparser.ast.expr.p) lVar).x0(pVar);
                    v(lVar, pVar);
                    return lVar;
                }
                if (!(lVar instanceof f)) {
                    f("Failed to parse lambda expression! Please create an issue at https://github.com/javaparser/javaparser/issues");
                    return lVar;
                }
                f fVar = (f) lVar;
                fVar.v0(i(fVar.t0(), pVar));
                return lVar;
            }
            pVar2 = new org.checkerframework.com.github.javaparser.ast.expr.p(y(lVar, pVar), d(new o(), new m((s0) lVar.l().orElse(null), EnumSet.noneOf(Modifier.class), new o(), new g(), false, new o(), ((y) lVar).getName())), pVar, false);
        }
        return pVar2;
    }

    public c j() {
        return l().g();
    }

    public abstract Token k();

    public abstract l l();

    public List<JavaToken> m() {
        return l().j();
    }

    public org.checkerframework.com.github.javaparser.ast.expr.c n(s0 s0Var, List<s0> list, org.checkerframework.com.github.javaparser.ast.type.d dVar, o<l> oVar, List<o<org.checkerframework.com.github.javaparser.ast.expr.a>> list2, org.checkerframework.com.github.javaparser.ast.expr.d dVar2) {
        o oVar2 = new o();
        for (int i = 0; i < list2.size(); i++) {
            oVar2.f(new org.checkerframework.com.github.javaparser.ast.a(list.get(i), oVar.l(i), list2.get(i)));
        }
        return new org.checkerframework.com.github.javaparser.ast.expr.c(s0Var, dVar, oVar2, dVar2);
    }

    public org.checkerframework.com.github.javaparser.ast.type.d o(org.checkerframework.com.github.javaparser.ast.type.d dVar, List<ArrayType.a> list) {
        fd.c C0 = ArrayType.C0(dVar);
        return ArrayType.D0((org.checkerframework.com.github.javaparser.ast.type.d) C0.a, new List[]{(List) C0.b, list}).p0();
    }

    public final String q(ParseException parseException) {
        StringBuilder sb = new StringBuilder("Parse error. Found ");
        StringBuilder sb2 = new StringBuilder();
        TreeSet treeSet = new TreeSet();
        int i = 0;
        int i7 = 0;
        while (true) {
            int[][] iArr = parseException.expectedTokenSequences;
            if (i >= iArr.length) {
                break;
            }
            if (i7 < iArr[i].length) {
                i7 = iArr[i].length;
            }
            int i8 = 0;
            while (true) {
                int[][] iArr2 = parseException.expectedTokenSequences;
                if (i8 < iArr2[i].length) {
                    treeSet.add(parseException.tokenImage[iArr2[i][i8]]);
                    i8++;
                }
            }
            i++;
        }
        Iterator it = treeSet.iterator();
        while (it.hasNext()) {
            String str = (String) it.next();
            sb2.append(" ");
            sb2.append(str);
        }
        sb.append("");
        Token token = parseException.currentToken.next;
        int i9 = 0;
        while (true) {
            if (i9 >= i7) {
                break;
            }
            String add_escapes = ParseException.add_escapes(token.image);
            if (i9 != 0) {
                sb.append(" ");
            }
            if (token.kind == 0) {
                sb.append(parseException.tokenImage[0]);
                break;
            }
            String str2 = "\"" + add_escapes + "\"";
            String str3 = parseException.tokenImage[token.kind];
            if (str3.equals(str2)) {
                sb.append(str3);
            } else {
                sb.append(" ");
                sb.append(str2);
                sb.append(" ");
                sb.append(str3);
            }
            token = token.next;
            i9++;
        }
        int[][] iArr3 = parseException.expectedTokenSequences;
        if (iArr3.length != 0) {
            int length = iArr3.length;
            sb.append(", expected");
            sb.append(length != 1 ? " one of " : "");
            sb.append(sb2.toString());
        }
        return sb.toString();
    }

    public JavaToken r(o<?> oVar) {
        return (!this.f2941c || oVar.isEmpty()) ? JavaToken.f : ((s0) oVar.l(0).l().get()).c();
    }

    public JavaToken s(JavaToken javaToken, JavaToken javaToken2) {
        if (!this.f2941c) {
            return null;
        }
        fd.i.b(javaToken);
        fd.i.b(javaToken2);
        return (javaToken.k() || javaToken2.h()) ? javaToken : javaToken2;
    }

    public JavaToken t(JavaToken javaToken, Node node) {
        if (this.f2941c) {
            return s(javaToken, ((s0) node.l().get()).c());
        }
        return null;
    }

    public <T extends Node> o<T> u(o<T> oVar, T t2) {
        if (oVar == null) {
            oVar = new o<>();
        }
        oVar.k(t2);
        return oVar;
    }

    public final void v(final Node node, final Node node2) {
        if (this.f2941c) {
            node.g().ifPresent(new Consumer() {
                @Override
                public final void accept(Object obj) {
                    j.this.p(node, node2, (Node) obj);
                }
            });
            node.k0(y(node, node2));
        }
    }

    public s0 w(JavaToken javaToken, JavaToken javaToken2) {
        if (this.f2941c) {
            return new s0(javaToken, javaToken2);
        }
        return null;
    }

    public s0 x(Node node, JavaToken javaToken) {
        if (this.f2941c) {
            return new s0(((s0) node.l().get()).c(), javaToken);
        }
        return null;
    }

    public s0 y(Node node, Node node2) {
        if (this.f2941c) {
            return new s0(((s0) node.l().get()).c(), ((s0) node2.l().get()).d());
        }
        return null;
    }

    public s0 z(int i, ParseException parseException) {
        int i7;
        s0 s0Var = null;
        JavaToken D = parseException.currentToken != null ? D() : null;
        do {
            i7 = k().kind;
            if (i7 == i) {
                break;
            }
        } while (i7 != 0);
        JavaToken D2 = D();
        if (D != null && D2 != null) {
            s0Var = w(D, D2);
        }
        this.b.add(new n0(q(parseException), s0Var, parseException));
        return s0Var;
    }
}