/* * Copyright (c) 2006-2011 Nuxeo SA (http://nuxeo.com/) and others. * * All rights reserved. This program and the accompanying materials * are made available under the terms of the Eclipse Public License v1.0 * which accompanies this distribution, and is available at * http://www.eclipse.org/legal/epl-v10.html * * Contributors: * Bogdan Stefanescu * Florent Guillaume */ package org.eclipse.ecr.core.model; import java.lang.reflect.Field; import java.util.HashSet; import java.util.Set; import junit.framework.TestCase; import org.eclipse.ecr.core.utils.SIDGenerator; public class TestSidGenerator extends TestCase { public void testGenerator() { Set<Long> ids = new HashSet<Long>(); for (int i = 0; i < 1000; i++) { long id = SIDGenerator.next(); if (!ids.add(id)) { fail("ID already generated"); } } } public void testGeneratorReset() throws Exception { Set<Long> ids = new HashSet<Long>(); for (int i = 0; i < 1000; i++) { long id = SIDGenerator.next(); if (!ids.add(id)) { fail("ID already generated"); } } // change the counter to a value near the max one to force a counter reset Field field = SIDGenerator.class.getDeclaredField("count"); field.setAccessible(true); field.set(null, Integer.MAX_VALUE - 1000); for (int i = 0; i < 3000; i++) { long id = SIDGenerator.next(); if (!ids.add(id)) { fail("ID already generated"); } } Integer counter = (Integer) field.get(null); assertEquals(2000, counter.intValue()); } }