可比较类型(对象)无法比较

时间:2018-09-02 03:54:49

标签: java generics comparable

我遇到了这个神秘的错误:

  

未为参数类型定义运算符>   java.lang.Comparable,java.lang.Comparable

到底是什么?

(这是代码)

public class BST<T extends Comparable<T>> {
    public static class Node<P extends Comparable<P>> {
        P val;
        Node<P> left;
        Node<P> right;

        public Node() {

        }

        public Node(P val) {
            this.val = val;
        }
    }

    Node<T> root;

    private void addValHelper(Node root, Node newNode) {
        if (root.val > newNode.val) { // <-- ERROR IS HERE
            if (root.left == null) {
                root.left = newNode;
            } else {
                addValHelper(root.left, newNode);
            }
        } else {
            if (root.right == null) {
                root.right = newNode;
            } else {
                addValHelper(root.right, newNode);
            }
        }
    }
}

1 个答案:

答案 0 :(得分:7)

Java没有运算符重载。您无法将比较类型与>进行比较。您需要改用root.val.compareTo(newNode.val)

顺便说一句:

  • Comparable是一个接口,而不是一个类
  • 您不需要指定<P extends Comparable<P>>
  • addValHelper代码移入Node类本身可能更有意义
  • Node实施Comparable可能很有意义。

这样,您的代码会更加习惯,并且不会将Node的字段暴露给BST。

public class BST<T implements Comparable<T>> {
    private final Node<T> root;

    /** Presumably this is run when a value is added.. */
    private void addValueHelper(Node rootNode, Node newNode) {
        rootNode.attachChild(newNode);
    }

    public static class Node implements Comparable<T> {
        private final T val;
        private Node left;
        private Node right;

        public Node(T val) {
            this.val = val;
        }

        public int compareTo(Node other) {
            return this.val.compareTo(other.val);
        }

        /**
         * Takes the given node and compares it with the current node.
         * If the current node is greater than the given node, the given node is placed to the left.
         * Otherwise it is placed to the right.
         */
        protected void attachChild(Node newNode) {
            if (this.compareTo(newNode) == 1) {
                if (this.left == null) {
                    this.left = newNode;
                    return;
                }
                this.left.attachChild(newNode);
                return;
            } 

            if (this.right == null) {
                this.right = newNode;
                return;
            }

            this.right.attachChild(newNode);
        }
    }
}