Clover coverage report - Ant Coverage
Coverage timestamp: Tue Apr 8 2003 20:43:55 EST
file stats: LOC: 124   Methods: 9
NCLOC: 40   Classes: 1
 
 Source file Conditionals Statements Methods TOTAL
LazyHashtable.java 0% 29.4% 33.3% 28.6%
 1   
 /*
 2   
  * The Apache Software License, Version 1.1
 3   
  *
 4   
  * Copyright (c) 2000-2003 The Apache Software Foundation.  All rights
 5   
  * reserved.
 6   
  *
 7   
  * Redistribution and use in source and binary forms, with or without
 8   
  * modification, are permitted provided that the following conditions
 9   
  * are met:
 10   
  *
 11   
  * 1. Redistributions of source code must retain the above copyright
 12   
  *    notice, this list of conditions and the following disclaimer.
 13   
  *
 14   
  * 2. Redistributions in binary form must reproduce the above copyright
 15   
  *    notice, this list of conditions and the following disclaimer in
 16   
  *    the documentation and/or other materials provided with the
 17   
  *    distribution.
 18   
  *
 19   
  * 3. The end-user documentation included with the redistribution, if
 20   
  *    any, must include the following acknowlegement:
 21   
  *       "This product includes software developed by the
 22   
  *        Apache Software Foundation (http://www.apache.org/)."
 23   
  *    Alternately, this acknowlegement may appear in the software itself,
 24   
  *    if and wherever such third-party acknowlegements normally appear.
 25   
  *
 26   
  * 4. The names "Ant" and "Apache Software
 27   
  *    Foundation" must not be used to endorse or promote products derived
 28   
  *    from this software without prior written permission. For written
 29   
  *    permission, please contact apache@apache.org.
 30   
  *
 31   
  * 5. Products derived from this software may not be called "Apache"
 32   
  *    nor may "Apache" appear in their names without prior written
 33   
  *    permission of the Apache Group.
 34   
  *
 35   
  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
 36   
  * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 37   
  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 38   
  * DISCLAIMED.  IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
 39   
  * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 40   
  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 41   
  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
 42   
  * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 43   
  * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 44   
  * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
 45   
  * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 46   
  * SUCH DAMAGE.
 47   
  * ====================================================================
 48   
  *
 49   
  * This software consists of voluntary contributions made by many
 50   
  * individuals on behalf of the Apache Software Foundation.  For more
 51   
  * information on the Apache Software Foundation, please see
 52   
  * <http://www.apache.org/>.
 53   
  */
 54   
 package org.apache.tools.ant.util;
 55   
 
 56   
 import java.util.Hashtable;
 57   
 import java.util.Enumeration;
 58   
 
 59   
 /** Hashtable implementation that allows delayed construction
 60   
  * of expensive objects
 61   
  *
 62   
  * All operations that need access to the full list of objects
 63   
  * will call initAll() first. Get and put are cheap.
 64   
  *
 65   
  * @since Ant 1.6
 66   
  */
 67   
 public class LazyHashtable extends Hashtable {
 68   
     protected boolean initAllDone=false;
 69   
 
 70  1368
     public LazyHashtable() {
 71  1368
         super();
 72   
     }
 73   
 
 74   
     /** Used to be part of init. It must be done once - but
 75   
      * we delay it until we do need _all_ tasks. Otherwise we
 76   
      * just get the tasks that we need, and avoid costly init.
 77   
      */
 78  0
     protected void initAll( ) {
 79  0
         if( initAllDone ) return;
 80  0
         initAllDone=true;
 81   
     }
 82   
 
 83   
 
 84  0
     public Enumeration elements() {
 85  0
         initAll();
 86  0
         return super.elements();
 87   
     }
 88   
 
 89  0
     public boolean isEmpty() {
 90  0
         initAll();
 91  0
         return super.isEmpty();
 92   
     }
 93   
 
 94  0
     public int size() {
 95  0
         initAll();
 96  0
         return super.size();
 97   
     }
 98   
 
 99  352
     public boolean contains( Object value ) {
 100  352
         initAll();
 101  352
         return super.contains(value);
 102   
     }
 103   
 
 104  0
     public boolean containsKey(Object value) {
 105  0
         initAll();
 106  0
         return super.containsKey(value);
 107   
     }
 108   
 
 109   
     /**
 110   
      * Delegates to {@link #contains contains}.
 111   
      */
 112  0
     public boolean containsValue( Object value ) {
 113  0
         return contains(value);
 114   
     }
 115   
 
 116  662
     public Enumeration keys() {
 117  662
         initAll();
 118  662
         return super.keys();
 119   
     }
 120   
 
 121   
     // XXX Unfortunately JDK1.2 adds entrySet(), keySet(), values() -
 122   
     // implementing this requires a small hack, we can add it later.
 123   
 }
 124