/* * Copyright (C) 2009 eXo Platform SAS. * * 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.exoplatform.services.jcr.impl.tools.tree.generator; import java.util.Random; import javax.jcr.ItemExistsException; import javax.jcr.Node; import javax.jcr.PathNotFoundException; import javax.jcr.RepositoryException; import javax.jcr.lock.LockException; import javax.jcr.nodetype.ConstraintViolationException; import javax.jcr.version.VersionException; /** * @author <a href="mailto:Sergey.Kabashnyuk@gmail.com">Sergey Kabashnyuk</a> * @version $Id: WeightNodeGenerator.java 11907 2008-03-13 15:36:21Z ksm $ */ public class WeightNodeGenerator implements NodeGenerator { private int maxDepth; private int maxWidth; protected Node currentNode; private static final Random random = new Random(); public WeightNodeGenerator(int maxDepth, int maxWidth) { super(); this.maxDepth = maxDepth; this.maxWidth = maxWidth; } public int getMaxDepth() { return maxDepth; } public void setMaxDepth(int maxDepth) { this.maxDepth = maxDepth; } public int getMaxWidth() { return maxWidth; } public void setMaxWidth(int maxWidth) { this.maxWidth = maxWidth; } protected void addNodes(Node parentNode, int level) throws ItemExistsException, PathNotFoundException, VersionException, ConstraintViolationException, LockException, RepositoryException { if (level >= maxDepth) return; // int maxNodesOnLevel = (int) Math.round((new Double(maxWidth) / new Double(maxDepth)) * // level); // maxNodesOnLevel = maxNodesOnLevel != 0 ? maxNodesOnLevel : 1; int maxNodesOnLevel = random.nextInt(maxWidth) + 1; for (int i = 0; i < maxNodesOnLevel; i++) { currentNode = parentNode.addNode("node_level_" + level + "_number_" + i + "_" + random.nextInt(Integer.MAX_VALUE)); addProperties(); addNodes(currentNode, level + 1); } } protected void addProperties() throws RepositoryException { } public void genereteTree(Node root) throws ItemExistsException, PathNotFoundException, VersionException, ConstraintViolationException, LockException, RepositoryException { addNodes(root, 1); } }