KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > uk > org > primrose > pool > test > QueueUnitTest


1 /**
2 * Library name : Primrose - A Java Database Connection Pool.
3 * Published by Ben Keeping, http://primrose.org.uk .
4 * Copyright (C) 2004 Ben Keeping, primrose.org.uk
5 * Email: Use "Contact Us Form" on website
6 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 */

21
22 package uk.org.primrose.pool.test;
23 import uk.org.primrose.pool.core.*;
24 import uk.org.primrose.pool.jmx.*;
25 import java.io.*;
26
27 public class QueueUnitTest {
28     public static void main(String JavaDoc args[]) throws Exception JavaDoc {
29         // This should get 10 connections from the database, and then
30
// wait for ever to check the constraints on pool size.
31
//Queue q = new Queue();
32
//q.startNewPool("poolOne", 5, 5, "poolOne.log", "localhost", "3306", "test", "dummy", "dummy");
33

34         //System.err.println("\n");
35

36         //PoolConnection pcArr[] = new PoolConnection[15];
37

38
39         //for (int i = 0; i < 15; i++) {
40
// PoolConnection pc = q.getConnection();
41
// pcArr[i] = pc;
42
// System.err.println(i +" " +pc +"\n");
43
//}
44

45 /*
46         for (int i = 0; i < 15; i++) {
47             System.err.println("\n");
48             //PoolConnection pc = pool.get();
49             if (i == 3) {
50                 pool.put(null);
51             } else {
52                 pool.put(pcArr[i]);
53             }
54         }
55 */

56     }
57 }
Popular Tags