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 primGroupsIncludedIn(primA, primB):
grA = houPrimGroups.primGroups(primA)
grB = houPrimGroups.primGroups(primB)
for gr in grA:
if gr not in grB:
return False
return True
def primGroupsIncludedIn(primA, primB):
grA = houPrimGroups.primGroups(primA)
grB = houPrimGroups.primGroups(primB)
for gr in grA:
if gr not in grB:
return False
return True
def userDefinedPrimGroups(prim):
groups = houPrimGroups.primGroups(prim)
userGroups = []
for gr in groups:
if "__" not in gr:
userGroups.append(gr)
return userGroups
def userDefinedPrimGroups(prim):
groups = houPrimGroups.primGroups(prim)
userGroups = []
for gr in groups:
if "__" not in gr:
userGroups.append(gr)
return userGroups
def printTerminalInserts(rootNode, tagName=None):
starting = startingPrims(rootNode)
for pr in starting:
print
print "*********************************************"
groups = houPrimGroups.primGroups(pr)
if not tagName or tagName in groups:
print "processing:", pr
traverseProductTree(pr, 1, nullOp, printInsertOp)
def printTerminalInserts(rootNode, tagName=None):
starting = startingPrims(rootNode)
for pr in starting:
print
print "*********************************************"
groups = houPrimGroups.primGroups(pr)
if not tagName or tagName in groups:
print "processing:", pr
traverseProductTree(pr, 1, nullOp, printInsertOp)
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