⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 tree.java

📁 Mobile 应用程序使用 Java Micro Edition (Java ME) 平台
💻 JAVA
📖 第 1 页 / 共 2 页
字号:
         * Used for instances of {@link BinaryTree} representing         * multiplication {@code *}.         */        MULTIPLY(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * division {@code /}.         */        DIVIDE(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * remainder {@code %}.         */        REMAINDER(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * addition or string concatenation {@code +}.         */        PLUS(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * subtraction {@code -}.         */        MINUS(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * left shift {@code <<}.         */        LEFT_SHIFT(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * right shift {@code >>}.         */        RIGHT_SHIFT(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * unsigned right shift {@code >>>}.         */        UNSIGNED_RIGHT_SHIFT(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * less-than {@code <}.         */        LESS_THAN(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * greater-than {@code >}.         */        GREATER_THAN(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * less-than-equal {@code <=}.         */        LESS_THAN_EQUAL(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * greater-than-equal {@code >=}.         */        GREATER_THAN_EQUAL(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * equal-to {@code ==}.         */        EQUAL_TO(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * not-equal-to {@code !=}.         */        NOT_EQUAL_TO(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * bitwise and logical "and" {@code &}.         */        AND(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * bitwise and logical "xor" {@code ^}.         */        XOR(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * bitwise and logical "or" {@code |}.         */        OR(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * conditional-and {@code &&}.         */        CONDITIONAL_AND(BinaryTree.class),        /**         * Used for instances of {@link BinaryTree} representing         * conditional-or {@code ||}.         */        CONDITIONAL_OR(BinaryTree.class),        /**         * Used for instances of {@link CompoundAssignmentTree} representing         * multiplication assignment {@code *=}.         */        MULTIPLY_ASSIGNMENT(CompoundAssignmentTree.class),        /**         * Used for instances of {@link CompoundAssignmentTree} representing         * division assignment {@code /=}.         */        DIVIDE_ASSIGNMENT(CompoundAssignmentTree.class),        /**         * Used for instances of {@link CompoundAssignmentTree} representing         * remainder assignment {@code %=}.         */        REMAINDER_ASSIGNMENT(CompoundAssignmentTree.class),        /**         * Used for instances of {@link CompoundAssignmentTree} representing         * addition or string concatenation assignment {@code +=}.         */        PLUS_ASSIGNMENT(CompoundAssignmentTree.class),        /**         * Used for instances of {@link CompoundAssignmentTree} representing         * subtraction assignment {@code -=}.         */        MINUS_ASSIGNMENT(CompoundAssignmentTree.class),        /**         * Used for instances of {@link CompoundAssignmentTree} representing         * left shift assignment {@code <<=}.         */        LEFT_SHIFT_ASSIGNMENT(CompoundAssignmentTree.class),        /**         * Used for instances of {@link CompoundAssignmentTree} representing         * right shift assignment {@code >>=}.         */        RIGHT_SHIFT_ASSIGNMENT(CompoundAssignmentTree.class),        /**         * Used for instances of {@link CompoundAssignmentTree} representing         * unsigned right shift assignment {@code >>>=}.         */        UNSIGNED_RIGHT_SHIFT_ASSIGNMENT(CompoundAssignmentTree.class),        /**         * Used for instances of {@link CompoundAssignmentTree} representing         * bitwise and logical "and" assignment {@code &=}.         */        AND_ASSIGNMENT(CompoundAssignmentTree.class),        /**         * Used for instances of {@link CompoundAssignmentTree} representing         * bitwise and logical "xor" assignment {@code ^=}.         */        XOR_ASSIGNMENT(CompoundAssignmentTree.class),        /**         * Used for instances of {@link CompoundAssignmentTree} representing         * bitwise and logical "or" assignment {@code |=}.         */        OR_ASSIGNMENT(CompoundAssignmentTree.class),        /**         * Used for instances of {@link LiteralTree} representing         * an integral literal expression of type {@code int}.         */        INT_LITERAL(LiteralTree.class),        /**         * Used for instances of {@link LiteralTree} representing         * an integral literal expression of type {@code long}.         */        LONG_LITERAL(LiteralTree.class),        /**         * Used for instances of {@link LiteralTree} representing         * a floating-point literal expression of type {@code float}.         */        FLOAT_LITERAL(LiteralTree.class),        /**         * Used for instances of {@link LiteralTree} representing         * a floating-point literal expression of type {@code double}.         */        DOUBLE_LITERAL(LiteralTree.class),        /**         * Used for instances of {@link LiteralTree} representing         * a boolean literal expression of type {@code boolean}.         */        BOOLEAN_LITERAL(LiteralTree.class),        /**         * Used for instances of {@link LiteralTree} representing         * a character literal expression of type {@code char}.         */        CHAR_LITERAL(LiteralTree.class),        /**         * Used for instances of {@link LiteralTree} representing         * a string literal expression of type {@link String}.         */        STRING_LITERAL(LiteralTree.class),		/**	 * Used for instances of {@link LiteralTree} representing	 * the use of {@code null}.	 */	NULL_LITERAL(LiteralTree.class),        /**         * Used for instances of {@link WildcardTree} representing         * an unbounded wildcard type argument.         */        UNBOUNDED_WILDCARD(WildcardTree.class),        /**         * Used for instances of {@link WildcardTree} representing         * an extends bounded wildcard type argument.         */        EXTENDS_WILDCARD(WildcardTree.class),        /**         * Used for instances of {@link WildcardTree} representing         * a super bounded wildcard type argument.         */        SUPER_WILDCARD(WildcardTree.class),        /**         * Used for instances of {@link ErroneousTree}.         */        ERRONEOUS(ErroneousTree.class),        /**         * An implementation-reserved node. This is the not the node         * you are looking for.         */        OTHER(null);                                Kind(Class<? extends Tree> intf) {            associatedInterface = intf;        }                        public Class<? extends Tree> asInterface() {            return associatedInterface;        }                private final Class<? extends Tree> associatedInterface;    }        /**     * Gets the kind of this tree.     *     * @return the kind of this tree.     */    Kind getKind();        /**     * Accept method used to implement the visitor pattern.  The     * visitor pattern is used to implement operations on trees.     *     * @param <R> result type of this operation.     * @param <D> type of additonal data.     */    <R,D> R accept(TreeVisitor<R,D> visitor, D data);}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -