Gnm.SolverIteratorCompound¶
- Subclasses:
None
Methods¶
- Inherited:
- Structs:
|
Virtual Methods¶
- Inherited:
Properties¶
Name |
Type |
Flags |
Short Description |
---|---|---|---|
r/w |
Maximum number of cycles |
Signals¶
- Inherited:
Fields¶
- Inherited:
Name |
Type |
Access |
Description |
---|---|---|---|
counts |
r |
||
cycle |
r |
||
cycle_progress |
r |
||
cycles |
r |
||
iterators |
[ |
r |
|
next |
r |
||
next_counter |
r |
||
parent |
r |
Class Details¶
- class Gnm.SolverIteratorCompound(**kwargs)¶
- Bases:
- Abstract:
No
- Structure:
- add(iter, count)¶
- Parameters:
iter (
Gnm.SolverIterator
) – sub-iteratorcount (
int
) – repeatGOffice.count
Add an iterator to a compound iterator with a given repeat
GOffice.count
. As a special case, a repeatGOffice.count
of zero means to try the iterator once in a cycle, but only if no other sub-iterator has shown any progress so far.