Home/ Questions/Q 6663765
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-26T02:32:06+00:00

Java doc TreeSet contains enigmatic assertion: The behavior of a TreeSet is well-defined even

  • 0

Java doc TreeSet contains enigmatic assertion: “The behavior of a TreeSet is well-defined even if its ordering is strictly partial; it just fails to obey the general contract of the Set interface. ” I wonder how is it possible to supply partially ordered elements when Comparable.compareTo() is defined for any pair of elements and therefore implies total relation (if total relation is reflexive, antisymmetric, and transitive, then it’s total order).

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    I don’t find any information about ‘partial’ in JavaDoc 5.

    A Red-Black tree works for the TreeSet implementation which has nothing with ‘partial’.

    Are you sure you are reading java.util.TreeSet?

    • 0