/** * Counts the number of nodes (i.e. branches and leaves) of this tree. The empty tree has no nodes. * * @return The number of nodes of this tree. */ default int nodeCount() { return length(); }
@Override default Seq<T> drop(int n) { if (n >= length()) { return Stream.empty(); } else { return values().drop(n); } }
@Override default Seq<T> dropRight(int n) { if (n >= length()) { return Stream.empty(); } else { return values().dropRight(n); } }
/** * Counts the number of nodes (i.e. branches and leaves) of this tree. The empty tree has no nodes. * * @return The number of nodes of this tree. */ default int nodeCount() { return length(); }
@Override default Seq<T> dropRight(int n) { if (n >= length()) { return Stream.empty(); } else { return values().dropRight(n); } }
@Override default Seq<T> drop(int n) { if (n >= length()) { return Stream.empty(); } else { return values().drop(n); } }