SolverResult

class SolverResult

Bases: UserList

Methods

__init__
append	S.append(value) -- append value to the end of the sequence
clear
copy
count
extend	S.extend(iterable) -- extend sequence by appending elements from the iterable
index	Raises ValueError if the value is not present.
insert	S.insert(index, value) -- insert value before index
pop	Raise IndexError if list is empty or index is out of range.
remove	S.remove(value) -- remove first occurrence of value.
reverse	S.reverse() -- reverse IN PLACE
sort

Attributes

solutions

__add__(other)

classmethod __class_getitem__()

Represent a PEP 585 generic type

E.g. for t = list[int], t.__origin__ is list and t.__args__ is (int,).

__contains__(item)

__copy__()

__delitem__(i)

__eq__(other)

Return self==value.

__ge__(other)

Return self>=value.

__getitem__(i)

__gt__(other)

Return self>value.

__iadd__(other)

__imul__(n)

__init__(*args, **kwargs)

__init_subclass__()

This method is called when a class is subclassed.

The default implementation does nothing. It may be overridden to extend subclasses.

__iter__()

__le__(other)

Return self<=value.

__len__()

__lt__(other)

Return self<value.

__mul__(n)

__radd__(other)

__repr__()

Return repr(self).

__reversed__()

__rmul__(n)

__setitem__(i, item)

classmethod __subclasshook__(C)

Abstract classes can override this to customize issubclass().

This is invoked early on by abc.ABCMeta.__subclasscheck__(). It should return True, False or NotImplemented. If it returns NotImplemented, the normal algorithm is used. Otherwise, it overrides the normal algorithm (and the outcome is cached).

append(item)

S.append(value) – append value to the end of the sequence

clear() → None -- remove all items from S

copy()

count(value) → integer -- return number of occurrences of value

extend(other)

S.extend(iterable) – extend sequence by appending elements from the iterable

index(value[, start[, stop]]) → integer -- return first index of value.

Raises ValueError if the value is not present.

Supporting start and stop arguments is optional, but recommended.

insert(i, item)

S.insert(index, value) – insert value before index

pop([index]) → item -- remove and return item at index (default last).

Raise IndexError if list is empty or index is out of range.

remove(item)

S.remove(value) – remove first occurrence of value. Raise ValueError if the value is not present.

reverse()

S.reverse() – reverse IN PLACE

sort(*args, **kwds)

__abstractmethods__ = frozenset({})

__deprecated__ = 'SolverResult is deprecated since amplify v1.0.0 and will no longer support in the near future.\nPlease see the migration guide for details: https://amplify.fixstars.com/docs/amplify/v1/migration.html'

__dict__ = mappingproxy({'__module__': 'amplify._backward', '__init__': <function SolverResult.__init__>, 'solutions': <property object>, '__doc__': None, '__abstractmethods__': frozenset(), '_abc_impl': <_abc._abc_data object>, '__new__': <staticmethod(<function object.__new__>)>, '__init_subclass__': <function SolverResult.__init_subclass__>, '__deprecated__': 'SolverResult is deprecated since amplify v1.0.0 and will no longer support in the near future.\nPlease see the migration guide for details: https://amplify.fixstars.com/docs/amplify/v1/migration.html', '__annotations__': {}})

__hash__ = None

__slots__ = ()

__weakref__

list of weak references to the object

property solutions: list[SolverSolution]