def childInserts(prim): childrenInserts = [] myGeo = prim.geometry() myNode = myGeo.sopNode() downstreamNodes = myNode.outputs() for n in downstreamNodes: if bE_general.is_Insert_node(n): groups = houPrimGroups.primGroups(prim) filters = bE_general.filters(n) for f in filters: if f in groups: childrenInserts.append(n) return childrenInserts
def childPrims(prim): children = [] myNode = parentNode(prim) downstreamNodes = myNode.outputs() for n in downstreamNodes: if not bE_general.is_Insert_node(n): for child in n.geometry().prims(): if isParent(prim, child): # print "isParent",prim, child children.append(child) # else: # print "is NOT Parent",prim, child return children
def childPrims(prim): children = [] myNode = parentNode(prim) downstreamNodes = myNode.outputs() for n in downstreamNodes: if not bE_general.is_Insert_node(n): for child in n.geometry().prims(): if isParent(prim, child): #print "isParent",prim, child children.append(child) #else: # print "is NOT Parent",prim, child return children