Allow arbitrary adapters to be registered to weight search results differently
Project description
Introduction
This is a simple product that patches the ZCatalog such that you can register sort adapters for results.
The main usecase for this is to tailor search results to specific business rules, eg. ‘Recent document are more important than old’ or ‘Documents from the CEO are more important than from the tea boy’.
To use it you need to write a utility that provides a sorted() method that can be passed a LazyMap of brains and re-score and re-sort them based upon your criteria.
See adapters.py for some examples.
Changelog
1.1
Fixed bug in utility being called twice
1.0
Initial release
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Close
Hashes for collective.searchweightings-1.1.tar.gz
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 5a3d574d5be212db14c92fd13eefeb348b0e7bb24d7465c02dbeb5c2064bbb2a |
|
| MD5 | 0bcee0451266ccb2550d8981a0fbeac5 |
|
| BLAKE2b-256 | 329ca8ea02cadbd66d9189d0168d8a20e099bd9d20d6ec886d0e2092855244cc |
