Hi,
Recently we had a hardware issue due to which numActive use to drop
drastically (in netstat I found that number of connections established to
oracle db was keep on reducing).
Enhancement/Suggession is to log a warning or recreate a new connection and
put into pool when _numActive < _minIdle
On 14.10.2007 04:35:27 Niall Pemberton wrote:
> On 10/11/07, Keith R. Bennett <[EMAIL PROTECTED]> wrote:
> >
> > Hello, all. I am working with the Apache Tika project. We found the need
> > to
> > get a newly opened input stream from the user, and possibly read it multiple
> > times. I am awa
Hi,
On 10/14/07, Niall Pemberton <[EMAIL PROTECTED]> wrote:
> I don't see anything in the javadocs for the mark/reset methods in
> InputStream that prevent it from being used for streams of arbitrary
> length.
> [...]
> Secondly, from a Commons IO perspective, we already have some of the
> functio
Online report :
http://vmbuild.apache.org/continuum/buildResult.action?buildId=13608&projectId=166
Build statistics:
State: Failed
Previous State: Failed
Started at: Mon 15 Oct 2007 06:10:36 -0700
Finished at: Mon 15 Oct 2007 06:10:57 -0700
Total time: 20s
Build Trigger: Schedule
Build Nu
Online report :
http://vmbuild.apache.org/continuum/buildResult.action?buildId=13675&projectId=166
Build statistics:
State: Failed
Previous State: Failed
Started at: Mon 15 Oct 2007 10:32:49 -0700
Finished at: Mon 15 Oct 2007 10:33:11 -0700
Total time: 21s
Build Trigger: Schedule
Build Nu
James Carman wrote:
> All,
>
> It's been a while since Commons Proxy has had any attention, but I
> have received two emails in the past two days about it. So, I would
> like to cut a 1.0 release for it. I know I need to do a little work,
> since the site is a bit out-dated (the SVN links are i
The current implementation of Percentile relies on sorting the
underlying array. There is much faster way like the use of Hoare's
partitioning that would take only linear instead of n*ln(n) time.
Has such improvement be considered before ? Any reason not to do so ?
Cheers,
Hanson Char
Done.
On 10/15/07, Jörg Schaible <[EMAIL PROTECTED]> wrote:
> James Carman wrote:
>
> > All,
> >
> > It's been a while since Commons Proxy has had any attention, but I
> > have received two emails in the past two days about it. So, I would
> > like to cut a 1.0 release for it. I know I need to d
Indeed, I was working on it this weekend as part of my work on Rolling
statistics (RollingPercentile.) I need to submit the patch this week so that
we can commit the changes - but there is some pending discussion about API
and high level design.
I agree that we should also replace the algorithm fo
Hi Bradford,
I thought it would be fun to implement one myself if no one else is
taking this up. Otherwise, I just play lazy :)
> Would you care to join me? ;-)
Sounds like fun too.
Hanson Char
On 10/15/07, Bradford Cross <[EMAIL PROTECTED]> wrote:
> Indeed, I was working on it this weekend
Did u take a look at the thread about my rolling statistics? if not i will
forward it.
for the rolling percentile, i needed a sorted deque. for the first pass, i
just wrapped the ResizeableDoubleArray from commons math together with a
LinkedList using the Collections.BinarySearch() for inserts.
11 matches
Mail list logo
