Module compatibility_tree

Checks off implementation node rules and matches them to potential clients fulfilling the required conditions (platform tuple, app, optionally name)

@param implementation node rules @type [node.Node]

Parameters:

• concert_clients - name indexed dictionary of concert client information @type dic(str, concert_msgs.ConcertClient)

  @return list of tuples, each of which is a node and list of clients that satisfy requirements for that node. @rtype CompatibilityTree

Recursive function that checks rule min/max allotments and prunes the compatibility tree. It assumes none are currently fixed, so pruning can happen anywhere.

@param branches listing compatible node - clients relationships @type [ CompatibilityBranch ]

This should be only called on a tree with branches that have redundancy (i.e. more potential clients than required (specified by node.min).

Does this by scanning the subtree looking for the least visible leaf (client) not including those with visibility one.

It also grabs the branches that leaf is on, and there should multiple possible branches, and subsequently chooses to lock it down on the branch with the least redundancy, i.e. pruning it from the rest of the tree.

This makes sure that there are plenty of possible options to cover the branches that match this leaf but are not chosen.

@param subtree @type [CompatibilityBranch]

Pretty prints a list of clients (names only)

@param leaves @type [concert_msgs.ConcertClient]