Menu
▾
▴
[Opentaps-dataimport-commits] [dataimport commits] r44 - in versions/0.9/trunk: entitydef script/mysql
|
From: Leon T. <le...@gr...> - 2007-01-11 17:38:31
|
Author: leon Date: 2007-01-11 09:38:26 -0800 (Thu, 11 Jan 2007) New Revision: 44 Added: versions/0.9/trunk/entitydef/entitymodel_product.xml versions/0.9/trunk/script/mysql/findRecursiveBoms.bsh Log: Added missing entitymodel file, added new script to find recursive BOM trees Added: versions/0.9/trunk/entitydef/entitymodel_product.xml =================================================================== --- versions/0.9/trunk/entitydef/entitymodel_product.xml 2007-01-10 22:27:02 UTC (rev 43) +++ versions/0.9/trunk/entitydef/entitymodel_product.xml 2007-01-11 17:38:26 UTC (rev 44) @@ -0,0 +1,61 @@ +<?xml version="1.0" encoding="UTF-8"?> +<!-- + * Copyright (c) 2006 - 2007 Open Source Strategies, Inc. + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the Honest Public License. + * + * This program 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 + * Honest Public License for more details. + * + * You should have received a copy of the Honest Public License + * along with this program; if not, write to Funambol, + * 643 Bair Island Road, Suite 305 - Redwood City, CA 94063, USA +--> + +<entitymodel xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" + xsi:noNamespaceSchemaLocation="http://www.ofbiz.org/dtds/entitymodel.xsd"> + <!-- ========================================================= --> + <!-- ======================== Defaults ======================= --> + <!-- ========================================================= --> + <title>Product Data Import Entities</title> + <description>Defines intermediate entities for importing customer data</description> + <copyright>Copyright (c) 2006 - 2007 Open Source Strategies, Inc.</copyright> + <author>Leon Torres (le...@op...)</author> + <version>1.0</version> + + <!-- ================================= --> + <!-- org.opentaps.dataimport.customers --> + <!-- ================================= --> + + <!-- for precise definitions of the field types see the file framework/entity/fieldtype/fieldtypeXXX.xml for your database XXX --> + + <entity entity-name="DataImportProduct" + package-name="org.opentaps.dataimport.products" + title="Intermediate import entity for product data."> + <field name="productId" type="id-ne"/> + <field name="productTypeId" type="id-ne"/> + <field name="customId1" type="id"/> + <field name="customId2" type="id"/> + <field name="description" type="description"/> + <field name="weight" type="floating-point"/> + <field name="weightUomId" type="id"/> + <field name="productLength" type="floating-point"/> + <field name="productLengthUomId" type="id"/> + <field name="width" type="floating-point"/> + <field name="widthUomId" type="id"/> + <field name="height" type="floating-point"/> + <field name="heightUomId" type="id"/> + <field name="price" type="currency-precise"/> + <field name="priceCurrencyUomId" type="id"/> + <field name="productFeature1" type="description"/> + <field name="processedTimestamp" type="date-time"> + <description>Special field for system to record when entry was successfully imported. + Do not use for any other purpose.</description> + </field> + <prim-key field="productId"/> + </entity> + +</entitymodel> Added: versions/0.9/trunk/script/mysql/findRecursiveBoms.bsh =================================================================== --- versions/0.9/trunk/script/mysql/findRecursiveBoms.bsh 2007-01-10 22:27:02 UTC (rev 43) +++ versions/0.9/trunk/script/mysql/findRecursiveBoms.bsh 2007-01-11 17:38:26 UTC (rev 44) @@ -0,0 +1,127 @@ +/** + * This script will find self-referential BOM tress. + */ +import java.util.*; +import org.ofbiz.entity.GenericDelegator; +import org.ofbiz.service.GenericDispatcher; +import org.ofbiz.base.util.*; +import org.ofbiz.entity.util.*; +delegator = GenericDelegator.getGenericDelegator("default"); +dispatcher = GenericDispatcher.getLocalDispatcher("ecommerce", delegator); +admin = delegator.findByPrimaryKey("UserLogin", UtilMisc.toMap("userLoginId", "admin")); + +// hard limit of recursions to print, set to -1 to find all +limit = -1; + +// store all recursion productIds +recursions = new HashSet(); + +boms = delegator.findByAnd("ProductAssoc", UtilMisc.toMap("productAssocTypeId", "MANUF_COMPONENT")); + +fromSet = new HashSet(); +toSet = new HashSet(); +for (iter = boms.iterator(); iter.hasNext(); ) { + bom = iter.next(); + + // detect self-referential entries + if (bom.get("productId").equals(bom.get("productIdTo"))) { + print("Self-referential entry detected: productId ["+bom.get("productId")+"], productIdTo ["+bom.get("productIdTo")+"]"); + recursions.add(bom.get("productId")); + iter.remove(); + continue; + } + + fromSet.add(bom.get("productId")); + toSet.add(bom.get("productIdTo")); +} + +// find entries that aren't referenced in productIdTo +rootBoms = new HashSet(); +for (iter = fromSet.iterator(); iter.hasNext(); ) { + from = iter.next(); + if (!toSet.contains(from)) + rootBoms.add(from); +} +rootSize = rootBoms.size(); +print("Root products detected: " + rootSize); + +// find all terminator products +termBoms = new HashSet(); +for (iter = toSet.iterator(); iter.hasNext(); ) { + to = iter.next(); + if (!fromSet.contains(to)) + termBoms.add(to); +} +termSize = termBoms.size(); +print("Terminator products detected: " + termSize); + +// remove all root and terminator entries to speed things up +for (iter = boms.iterator(); iter.hasNext(); ) { + bom = iter.next(); + if (rootBoms.contains(bom.get("productId"))) + iter.remove(); + else if (termBoms.contains(bom.get("productIdTo"))) + iter.remove(); +} + +// if a recursion is encountered, returns true +boolean walkTree(String parentId, Set allChildren, int level, String rootId) { + hasRecursions = false; + directChildren = new HashSet(); + + line = ""; + if (rootId != null) { + indent = ""; + for (int i = 0; i < level; i++) indent += "-"; + line = indent + (level == 0 ? "" : "> ") + parentId; + } + + for (iter = boms.iterator(); iter.hasNext(); ) { + bom = iter.next(); + if (parentId.equals(bom.get("productId"))) { + childId = bom.get("productIdTo"); + if (recursions.contains(childId)) { + hasRecursions = true; + if (rootId != null && rootId.equals(childId)) line += "\n" + indent + "-> " + childId + " RECURSION"; + continue; + } else if (allChildren.contains(childId)) { // TODO: this doesn't necessarily identify a recursion, it could identify a common terminus + recursions.add(childId); + hasRecursions = true; + if (rootId != null && rootId.equals(childId)) line += "\n" + indent + "-> " + childId + " RECURSION"; + continue; + } + directChildren.add(childId); + } + } + + if (rootId != null) print(line); + + // walk the non-recursive children + allChildren.addAll(directChildren); + for (iter = directChildren.iterator(); iter.hasNext(); ) { + if (walkTree(iter.next(), allChildren, level + 1, rootId)) + hasRecursions = true; + } + return hasRecursions; +} + +// for each remaining node, traverse its children and look for a self-reference +for (iter = boms.iterator(); iter.hasNext(); ) { + bom = iter.next(); + productId = bom.get("productId"); + if (recursions.contains(productId)) continue; + set = new HashSet(); + set.add(productId); + if (!walkTree(productId, set, 0, null)) { + iter.remove(); // remove the non-recursive trees to speed things up + } + if (limit != -1 && recursions.size() >= limit) break; +} + +// print the recursion trees found (note that those that have no children are not actually recursions, they're terminations) +for (iter = recursions.iterator(); iter.hasNext(); ) { + id = iter.next(); + set = new HashSet(); + set.add(id); + walkTree(id, set, 0, id); +} |
