Re: [Digester] Problems setting a bean property
On 6/30/05, Martin Burger [EMAIL PROTECTED] wrote: Dion Gillard schrieb am 30.06.2005 08:57: How is the Beans/Introspector supposed to know if it's a read/write property of type String or a read-only property of type boolean? If there's a setter setting a value of type O, and there's a getter returning a value of type O, then it should be a read / write property of type O, shouldn't? If that was all there was, that would be fine. But in your example, there's also a getter of type P. So now the property is what type? Thanks, Martin - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] -- http://www.multitask.com.au/people/dion/ You are going to let the fear of poverty govern your life and your reward will be that you will eat, but you will not live. - George Bernard Shaw - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
[collections] Name that data structure
I'm looking through the Collections API, but not finding exactly what I want... hoping someone who's more familiar with it can point me in the right direction. What I'm trying to do is more or less what you see on catalog sites where they'll list the most recent items you've looked at, newest on top. So it's ordered (List), but has no duplicates (Set), and I need to have a max size. ListOrderedSet is almost there, except that it retains the 'old' position if you add the same item again. (And has no max length.) So... before I either write it myself or extend ListOrderedSet to make it do what I want, does anyone have another suggestion? And what would _you_ call it? Thanks, Wendy Smoak - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
[ANNOUNCEMENT] Betwixt 0.7 Release Candidate 2 Now Available
The second candidate for the Betwixt 0.7 release is now available for download (http://people.apache.org/~rdonkin/commons-betwixt/). The documentation can be viewed online (http://people.apache.org/~rdonkin/commons-betwixt/site/). This candidate contains one important fix and some improvements to the documentation. Please test this release candidate and report any problems to the commons-dev mailing list. Robert signature.asc Description: This is a digitally signed message part
Re: [collections] Name that data structure
I'd say you were looking for an ordinary priority queue, where the priority=the timestamp. Try the Heap class. Sincerely, Silas Snider On 7/3/05, Wendy Smoak [EMAIL PROTECTED] wrote: I'm looking through the Collections API, but not finding exactly what I want... hoping someone who's more familiar with it can point me in the right direction. What I'm trying to do is more or less what you see on catalog sites where they'll list the most recent items you've looked at, newest on top. So it's ordered (List), but has no duplicates (Set), and I need to have a max size. ListOrderedSet is almost there, except that it retains the 'old' position if you add the same item again. (And has no max length.) So... before I either write it myself or extend ListOrderedSet to make it do what I want, does anyone have another suggestion? And what would _you_ call it? Thanks, Wendy Smoak - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] -- -- Silas Snider is a proud member of the Association of Wikipedians Who Dislike Making Broad Judgements About the Worthiness of a General Category of Article, and Who Are In Favor of the Deletion of Some Particularly Bad Articles, but That Doesn't Mean They are Deletionist (AWWDMBJAWGCAWAIFDSPBATDMTD) , and the Harmonious Editing Club of Wikipedia. -- - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
