/******************************************************************************* * Copyright (c) 2007, 2010 Association for Decentralized Information Management * in Industry THTH ry. * 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: * VTT Technical Research Centre of Finland - initial API and implementation *******************************************************************************/ package org.simantics.db.tests.regression.bugs; import static org.junit.Assert.assertTrue; import java.io.IOException; import org.junit.Test; import org.simantics.databoard.Bindings; import org.simantics.databoard.binding.error.BindingConstructionException; import org.simantics.databoard.type.Datatype; import org.simantics.databoard.util.binary.RandomAccessBinary; import org.simantics.databoard.util.binary.RandomAccessBinary.ByteSide; import org.simantics.db.ReadGraph; import org.simantics.db.Resource; import org.simantics.db.Session; import org.simantics.db.WriteGraph; import org.simantics.db.common.request.ReadRequest; import org.simantics.db.common.request.WriteRequest; import org.simantics.db.exception.DatabaseException; import org.simantics.db.testing.base.ExistingDatabaseTest; import org.simantics.db.testing.impl.Configuration; import org.simantics.layer0.Layer0; public class Issue3176Test2 extends ExistingDatabaseTest { @Test public void testRandom() { try { int nBlocks = Configuration.get().i3176BlockCount; int[] blockSize = { 1024, 0xFFFF, 1<<20 }; final int LENGTH = blockSize.length; for (int i=0; i newBlocks); session.syncRequest(new WriteRequest() { @Override public void perform(WriteGraph graph) throws DatabaseException { graph.markUndoPoint(); Layer0 l0 = Layer0.getInstance(graph); Resource literal = graph.getSingleObject(file, l0.Literal); RandomAccessBinary rab = graph.getRandomAccessBinary(literal); try { rab.position(0); final int T_BLOCKS = newBlocks < 0 ? N_BLOCKS : newBlocks; byte[] block = createBlock(BLOCK_SIZE, inc); for (int i=0; i