Home | Trees | Indices | Help |
|
---|
|
object --+ | Ranking
A Ranking objects combines a scoreing strategy, a validation strategy and a rankable object (course or category) and computes a ranking. The Ranking object is an interable object, which means you can use it much like a list. It returns a new iterator on every call to __iter__. The order of the ranking is defined by the scoreing strategy. Strategy has the be a subclass of AbstractScoreing compatible with the RankableItem objects of this Rankable. The ranking is generated in lowest first order. Reverse rankings are possible.
The iterator returns dictionaries with the keys 'rank', 'scoreing', 'validation', 'item'.
Rankings are lazyly computed, but not updated unless you eihter call the update mehtod or iterate over them.
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from |
|
|||
Inherited from |
|
x.__init__(...) initializes x; see help(type(x)) for signature
|
Iterating over the ranking automatically updates the ranking. This is mainly for backwards compatibility. |
|
|
Return information dict for one item
|
|
|
Update the ranking. Rankings are not updated automatically. |
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Fri Nov 3 23:56:08 2023 | http://epydoc.sourceforge.net |