/* * JBoss, Home of Professional Open Source * Copyright 2009 Red Hat Inc. and/or its affiliates and other * contributors as indicated by the @author tags. All rights reserved. * See the copyright.txt in the distribution for a full listing of * individual contributors. * * This is free software; you can redistribute it and/or modify it * under the terms of the GNU Lesser General Public License as * published by the Free Software Foundation; either version 2.1 of * the License, or (at your option) any later version. * * This software is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this software; if not, write to the Free * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA * 02110-1301 USA, or see the FSF site: http://www.fsf.org. */ package org.infinispan.marshall; import org.infinispan.test.AbstractInfinispanTest; import org.testng.annotations.Test; import java.lang.reflect.Field; import java.lang.reflect.Modifier; import java.util.HashMap; import java.util.HashSet; import java.util.Map; import java.util.Set; @Test(groups = "unit", testName = "marshall.DuplicateIdTest") public class DuplicateIdTest extends AbstractInfinispanTest { public void testDuplicateMarshallerIds() throws Exception { Class idHolder = Ids.class; Map<Byte, Set<String>> dupes = new HashMap<Byte, Set<String>>(); for (Field f : idHolder.getDeclaredFields()) { if (Modifier.isStatic(f.getModifiers()) && Modifier.isFinal(f.getModifiers()) && f.getType().equals(byte.class)) { byte val = (Byte) f.get(null); Set<String> names = dupes.get(val); if (names == null) names = new HashSet<String>(); names.add(f.getName()); dupes.put(val, names); } } int largest = 0; for (Map.Entry<Byte, Set<String>> e : dupes.entrySet()) { assert e.getValue().size() == 1 : "ID " + e.getKey() + " is duplicated by fields " + e.getValue(); largest = Math.max(largest, e.getKey()); } System.out.println("Next available ID is " + (largest + 1)); } }