Skip to main content

A custom folder ordering implementation, which stores order persistently, but sorts content based on a rule.

Project description

Introduction
============


This product provides a couple IOrdering adpaters to provide efficient
auto-sorting of folders with significant amounts of content.

It includes a title (``flexible-title-ordering``) and id
(``flexible-id-ordering``) ordering, but is intended to allow easy
creation of custom sorts.

It is easy to create custom ordering implementations by subclassing
one of the included implementations and simply overriding the
``key_func(obj)`` method which generates a sort key for contained
content. Essentially, any ordering can be achieved in this manner.

Note: The full data structure containing the folder order key -> id
mapping is stored on the folder itself. This means that folder
instances with a large amount of content may become somewhat large,
but that order lookups should be quite fast.

Credits
-------


Alec Mitchell
Jazkarta, Inc.

With thanks to:
Dumbarton Oaks
KCRW Radio

Changelog
=========

1.0beta1 (2014-03-08)
-------------------

- Initial release

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Filename, size & hash SHA256 hash help File type Python version Upload date
collective.flexibleordering-1.0beta2.zip (19.9 kB) Copy SHA256 hash SHA256 Source None Jun 5, 2014

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page