This project implements the management of disjoint sets of real intervals, allowing you to manipulate intervals that do not overlap. It provides classic set operations (union, intersection, bounding, application of linear functions, etc.) on these intervals.

• Intervalle.java: Represents a real interval, with inclusive or exclusive bounds.
• EnsembleDisjoint.java: Manages a set of disjoint intervals and provides set operations.

• Union: Merges intervals or sets of intervals, ensuring they remain disjoint.
• Intersection: Computes the intersection between a set and an interval or another set.
• Bounding: Restricts the values of the set to an upper or lower bound.
• Linear function application: Applies a linear function to all intervals in the set.
• Membership: Checks if a value belongs to the set.

Compile the Java files: javac src/*.java

• Intervals are always kept disjoint and sorted.