summaryrefslogtreecommitdiffstats
path: root/base/common/python/_static
diff options
context:
space:
mode:
Diffstat (limited to 'base/common/python/_static')
0 files changed, 0 insertions, 0 deletions
generated by cgit (git 2.34.1) at 2026-01-16 12:38:03 +0000
f add_edge!(*args) @reversal = nil super end def add_vertex!(*args) @reversal = nil super end def clear @vertex_dict.clear if defined? @edge_number @edge_number.clear end end # Make sure whichever edge has a label keeps the label def copy_label(source, target, label) # 'require' relationships will not have a label, # and all 'subscribe' relationships have the same # label, at least for now. # Labels default to {}, so we can't just test for nil. newlabel = label || {} oldlabel = edge_label(source, target) || {} if ! newlabel.empty? and oldlabel.empty? edge_label_set(source, target, label) # We should probably check to see if the labels both exist # and don't match, but we'd just throw an error which the user # couldn't do anyting about. end end # Which resources a given resource depends upon. def dependents(resource) tree_from_vertex2(resource).keys end # Which resources depend upon the given resource. def dependencies(resource) # Cache the reversal graph, because it's somewhat expensive # to create. unless defined? @reversal and @reversal @reversal = reversal end