Daypack-lib

Daypack-lib is a schedule, time and time slots handling library

Note: Daypack is still WIP

The core scheduling and progress tracking functionalities are largely finished, but facilities for usage of library in frontend, and the frontend itself are still underway

Demos

Daypc (cli frontend)

TODO

Daypack_lib (core library)

See here TODO

Features

Overview
Details

Constraints (or scheduling strategies) supported
Details

Note: The following lists all the constraints supported by the core library, but frontends may not expose them completely

Architecture and limitations

Details

Daypack does not aim to be a general solver, and only supports a limited set of constraints (which are listed above)

Furthermore, Daypack only uses a backtracking search procedure with pruning (implemented using lazy sequences) for solving the constraints, and does not use any advanced or potentially more efficient constraint solving techniques

It is subsequently inferior to a lot of other automatic task scheduling software, and cannot accomodate very complex scheduling scenarios

Nevertheless, we hope that the supported constraints are powerful enough for a simple and standalone personal task scheduler

More detailed docs on the way

Some of the features that Daypack does NOT support

Getting started

Installation

TODO

User guide

See here TODO for daypc user guide

See here TODO for daypack_lib library documentation

Contributions

Ideas

Got a feature request? Feel free to open an issue to start a discussion.

Please note that since Daypack was never designed to be a general solver, there are things prohibitively expensive to properly implement as a result (short of adding a general solver into Daypack), which we may cite as a reason should we reject your feature request

We ask for your understanding should that be the case

Code

Code contributions are welcome. Please note that by submitting your original work, you agree to license your work under the MIT license.

Acknowledgements

LICENSE

MIT