version of Velocity. We still maintain a modified version because we want to be
able to access object fields directly instead of requiring getter/setter
methods, but with the other requirement gone normal people can compile and use
Samskivert with the stock Velocity distribution and not have to worry. It also
makes it vastly easier for us to keep up with the latest version of Velocity.
git-svn-id: https://samskivert.googlecode.com/svn/trunk@1739 6335cc39-0255-0410-8fd6-9bcaacd3b74c
to a RunQueue to run the expired() method: calling it Runnable resulted
in annoyance when one desired to create an anonymous java.lang.Runnable
inside one's own Interval.
git-svn-id: https://samskivert.googlecode.com/svn/trunk@1737 6335cc39-0255-0410-8fd6-9bcaacd3b74c
or if any unspecified error or hiccup occurs within the acidic innards of
the JVM. If that's the case, we probably will fail deleting the directory
itself below these lines, but it's better than throwing a NPE and
sticking a fork in everything.
git-svn-id: https://samskivert.googlecode.com/svn/trunk@1736 6335cc39-0255-0410-8fd6-9bcaacd3b74c
that everywhere; deprecated Comparators.REVERSE_COMPARABLE.
- Added a note that the ReversingComparator is old news, too, but we're not
ready to go 1.5 everywhere...
- Added Comparators.LEXICAL_CASE_INSENSITIVE which treats all sorted
objects as Strings that are sorted case insensitively.
- Have TableSorter use standard Comparators.
git-svn-id: https://samskivert.googlecode.com/svn/trunk@1733 6335cc39-0255-0410-8fd6-9bcaacd3b74c
Interval.Runnable, that can be used to retrieve the Interval from the
java.lang.Runnable posted on a RunQueue.
git-svn-id: https://samskivert.googlecode.com/svn/trunk@1717 6335cc39-0255-0410-8fd6-9bcaacd3b74c
that is FIXED, force everyone to use that. Rejiggered some stuff to
potentially half the number of HashMap lookups done during layout for
each component in our target container.
git-svn-id: https://samskivert.googlecode.com/svn/trunk@1714 6335cc39-0255-0410-8fd6-9bcaacd3b74c
if the layout policy is STRETCH. It would probably also make sense to
make them work with EQUALIZE, but that would require a few more changes.
(If the maximum width component had a weight of 2 you could set the
baseline width to half that.)
git-svn-id: https://samskivert.googlecode.com/svn/trunk@1713 6335cc39-0255-0410-8fd6-9bcaacd3b74c
You don't implement Map, you don't grow or shrink...
but at least now you return Interators and have a proper entrySet() method.
(Added a note that maybe someday we should fix it up more.)
git-svn-id: https://samskivert.googlecode.com/svn/trunk@1703 6335cc39-0255-0410-8fd6-9bcaacd3b74c
the keys in the map, which may be Interated over, etc.
- Moved the Entry definition into IntMap where it always should have been,
I think originally I had it in HashIntMap so that the extra annoying import
wasn't necessary. Added an empty subinterface to HashIntMap for backwards
compatability.
- Implemented an optimized putAll() in HashIntMap when adding other IntMaps.
git-svn-id: https://samskivert.googlecode.com/svn/trunk@1701 6335cc39-0255-0410-8fd6-9bcaacd3b74c
the class is SortableArrayList rather than SortedArrayList (which would
just always insert sorted in add()).
git-svn-id: https://samskivert.googlecode.com/svn/trunk@1698 6335cc39-0255-0410-8fd6-9bcaacd3b74c
elements in the passed in collection that are Iterators or Collections.
- Nixed SortedIterator, added variants of getSortedIterator() to
Collections.
- Also added getUnmodifiableIterator() and getRandomIterator() to
Collections.
git-svn-id: https://samskivert.googlecode.com/svn/trunk@1696 6335cc39-0255-0410-8fd6-9bcaacd3b74c
mdb