001 /** 002 * ======================================== 003 * JFreeReport : a free Java report library 004 * ======================================== 005 * 006 * Project Info: http://reporting.pentaho.org/ 007 * 008 * (C) Copyright 2000-2007, by Object Refinery Limited, Pentaho Corporation and Contributors. 009 * 010 * This library is free software; you can redistribute it and/or modify it under the terms 011 * of the GNU Lesser General Public License as published by the Free Software Foundation; 012 * either version 2.1 of the License, or (at your option) any later version. 013 * 014 * This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; 015 * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. 016 * See the GNU Lesser General Public License for more details. 017 * 018 * You should have received a copy of the GNU Lesser General Public License along with this 019 * library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, 020 * Boston, MA 02111-1307, USA. 021 * 022 * [Java is a trademark or registered trademark of Sun Microsystems, Inc. 023 * in the United States and other countries.] 024 * 025 * ------------ 026 * $Id: AttributeNameGenerator.java 2725 2007-04-01 18:49:29Z taqua $ 027 * ------------ 028 * (C) Copyright 2000-2005, by Object Refinery Limited. 029 * (C) Copyright 2005-2007, by Pentaho Corporation. 030 */ 031 032 package org.jfree.report.util; 033 034 import java.util.HashMap; 035 036 /** 037 * Creation-Date: 21.11.2006, 13:24:41 038 * 039 * @author Thomas Morgner 040 */ 041 public class AttributeNameGenerator 042 { 043 private HashMap names; 044 045 public AttributeNameGenerator() 046 { 047 names = new HashMap(); 048 } 049 050 public String generateName (final String base) 051 { 052 final Long keyObject = (Long) names.get(base); 053 if (keyObject == null) 054 { 055 names.put (base, new Long(0)); 056 return base; 057 } 058 else 059 { 060 long keyIdx = keyObject.longValue(); 061 String newName = base + keyIdx; 062 while (names.containsKey(newName)) 063 { 064 keyIdx += 1; 065 newName = base + keyIdx; 066 } 067 068 names.put (newName, new Long (0)); 069 names.put (base, new Long (keyIdx)); 070 return newName; 071 } 072 } 073 074 public void reset () 075 { 076 names.clear(); 077 } 078 }