````myInts = [ -3, 0, 4 ]
````myFloats = [ -2.2, 0.0, 1.1 ]

````    'aBool': myBools,
````    'bInt': myInts,
````    'cFloat': myFloats,
````}

Now, how do I get a list of dicts for all permutations of aBool, bInt and cFloat?  Each list entry will be a dict.  Each dict will have a unique set of values representing one permutation.

Expected:

````myPermList = [
````    { 'aBool': True, 'bInt': -3, 'cFloat': -2.2 },
````    { 'aBool': True, 'bInt': -3, 'cFloat': 0.0 },
````    { 'aBool': True, 'bInt': -3, 'cFloat': 1.1 },
````    # ...
````    { 'aBool': False, 'bInt': 4, 'cFloat': -2.2 },
````    { 'aBool': False, 'bInt': 4, 'cFloat': 0.0 },
````    { 'aBool': False, 'bInt': 4, 'cFloat': 1.1 },
````]

I am having trouble trying to figure out if itertools.permutations can help me here and if so, how to set up the call.

The intended use of such a technique is to help automate testing of some other functions in a comprehensive and systematic way so that I can extend lists to include good as well as bad data to test both correct functionality in the case of good data and proper error handling in the case of bad data.

myBools, myInts and myFloats will represent tests for various data types that can be reused.  These may be mixed in the future (i.e. test int and float data).  But the code as written represents the simplest and most generic input and output data structures that I could think of.