| org.cougaar.util.ArrayListFoundation org.cougaar.util.TimeSpanSet
All known Subclasses: org.cougaar.util.SynchronizedTimeSpanSet, org.cougaar.util.NonOverlappingTimeSpanSet,
TimeSpanSet | public class TimeSpanSet extends ArrayListFoundation implements SortedSet,Serializable(Code) | | A Collection which implements a set of TimeSpan elements
which are maintained sorted first by start time and then by
end time. The order of temporally-equivalent but non-equal
objects is undefined but stable.
|
TimeSpanSet | public TimeSpanSet()(Code) | | |
TimeSpanSet | public TimeSpanSet(int i)(Code) | | |
encapsulatedSet | final public Collection encapsulatedSet(long startTime, long endTime)(Code) | | the subset of elements which are completely enclosedby the specified time span. |
encapsulatedSet | final public Collection encapsulatedSet(TimeSpan span)(Code) | | the subset of elements which are completely enclosedby the specified time span. |
encapsulatingSet | final public Collection encapsulatingSet(TimeSpan span)(Code) | | the subset of elements which completely enclosethe specified time span. |
getMinimalIntersectingElement | public Object getMinimalIntersectingElement(long time)(Code) | | the intersecting Element with the smallest timespan.The result is undefined if there is a tie for smallest and null if there are no elements. |
intersectingSet | final public Collection intersectingSet(long time)(Code) | | the subset of elements which intersect with the specified time. |
intersectingSet | final public Collection intersectingSet(long startTime, long endTime)(Code) | | the subset of elements which intersect with thespecified time span. |
intersectingSet | final public Collection intersectingSet(TimeSpan span)(Code) | | the subset of elements which intersect with thespecified time span. |
search | final protected int search(TimeSpan o)(Code) | | the index of the first object in the list which is notless than the specified object. If there are no elements orall elements are less than the specified timespan, willreturn the length of the list. |
search | final protected int search(long t0, long t1)(Code) | | the index of the first object in the list which is notless than the specified span. If there are no elements orall elements are less than the specified timespan, willreturn the length of the list. |
unsafeUpdate | protected boolean unsafeUpdate(Collection c)(Code) | | unsafeUpdate - replaces all elements with specified Collection
Should only be used if c has already been validated.
boolean - true if any elements added else false. |
|
|