wirecell.img.clusters Namespace Reference

Classes
class	ClusterMap

Functions
def	match_dict (have, want)

Detailed Description

Handle cluster graphs.

A cluster graph is a networkx graph with nodes holding a letter "type
code" (c,w,b,s,m) and a code-dependent data structure

Function Documentation

def wirecell.img.clusters.match_dict	(		have,
			want
	)

return True if all keys of want are in have and all their values are equal.

Definition at line 9 of file clusters.py.

def match_dict(have, want):
    '''
    return True if all keys of want are in have and all their values are equal.
    '''
    for w in want:
        if w not in have:
            return False
        if have[w] != want[w]:
            return False
    return True