Respect exclude from bom in all python files
Two scripts were missing the excludeBOM=True selector.
This commit is contained in:
parent
169ece3b71
commit
a1f796ffa0
|
@ -52,10 +52,13 @@ out.writerow( ['Generator:', sys.argv[0]] )
|
||||||
out.writerow(['Component Count:', len(net.components)])
|
out.writerow(['Component Count:', len(net.components)])
|
||||||
out.writerow(['Ref', 'Qnty', 'Value', 'Cmp name', 'Footprint', 'Description', 'Vendor', 'DNP'])
|
out.writerow(['Ref', 'Qnty', 'Value', 'Cmp name', 'Footprint', 'Description', 'Vendor', 'DNP'])
|
||||||
|
|
||||||
|
# subset the components to those wanted in the BOM, controlled
|
||||||
|
# by <configure> block in kicad_netlist_reader.py
|
||||||
|
components = net.getInterestingComponents( excludeBOM=True )
|
||||||
|
|
||||||
# Get all of the components in groups of matching parts + values
|
# Get all of the components in groups of matching parts + values
|
||||||
# (see ky_generic_netlist_reader.py)
|
# (see ky_generic_netlist_reader.py)
|
||||||
grouped = net.groupComponents()
|
grouped = net.groupComponents(components)
|
||||||
|
|
||||||
# Output all of the component information
|
# Output all of the component information
|
||||||
for group in grouped:
|
for group in grouped:
|
||||||
|
|
|
@ -86,9 +86,11 @@ out = csv.writer(f, lineterminator='\n', delimiter=',', quotechar='\"', quoting=
|
||||||
# Output a CSV header
|
# Output a CSV header
|
||||||
out.writerow(header_names)
|
out.writerow(header_names)
|
||||||
|
|
||||||
|
components = net.getInterestingComponents( excludeBOM=True )
|
||||||
|
|
||||||
# Get all of the components in groups of matching parts + values
|
# Get all of the components in groups of matching parts + values
|
||||||
# (see kicad_netlist_reader.py)
|
# (see kicad_netlist_reader.py)
|
||||||
grouped = net.groupComponents()
|
grouped = net.groupComponents(components)
|
||||||
|
|
||||||
# Output all of the component information
|
# Output all of the component information
|
||||||
index = 1
|
index = 1
|
||||||
|
|
Loading…
Reference in New Issue