Commit message (Collapse) | Author | Files | Lines | ||
---|---|---|---|---|---|
2012-08-07 | db_selection: rename to DatabaseSelection | Max Kellermann | 2 | -3/+3 | |
2012-08-07 | Database{Plugin,Visitor}: pass references | Max Kellermann | 2 | -8/+8 | |
2012-08-02 | DatabasePlugin: make Visit() const | Max Kellermann | 2 | -4/+4 | |
2012-08-02 | gcc.h: re-add gcc_const and gcc_pure | Max Kellermann | 1 | -5/+4 | |
Remove GLib dependency from some headers. | |||||
2012-08-01 | db_plugin: convert to C++ | Max Kellermann | 3 | -184/+184 | |
2012-07-10 | require GLib 2.16 | Max Kellermann | 1 | -1/+0 | |
GLib 2.16 was released more than 4 years ago. Let's remove some cruft from the glib_compat.h header, and avoid new cruft to it. | |||||
2012-02-02 | directory: require the caller to lock the db_mutex | Max Kellermann | 1 | -2/+11 | |
Reduce the number of lock/unlock cycles, and make database handling safer. | |||||
2012-01-24 | directory: replace dirvec with doubly linked list | Max Kellermann | 1 | -2/+6 | |
Random access is not needed, and a linked list is easier to manage: we don't need to (re-)allocate the pointer array. | |||||
2012-01-24 | directory: simplify constructors and clarify API documentation | Max Kellermann | 1 | -2/+2 | |
Pass only the "name" to a directory, instead of the full (relative) path. | |||||
2012-01-12 | db/simple: pass the correct GError pointer | Max Kellermann | 1 | -1/+1 | |
2011-09-13 | db_plugin: add method visit() | Max Kellermann | 1 | -0/+41 | |
2011-09-13 | db_plugin: add method get_song() | Max Kellermann | 1 | -0/+17 | |
New db_get_song() implementation. | |||||
2011-09-10 | db_plugin: introducing a plugin API for the song database | Max Kellermann | 2 | -0/+329 | |
First draft, not really pluggable currently - hard-coded to use the "simple" plugin, and calls several of its internal functions. The API is very simple currently, all searches are still performed over the root "directory" object. Future changes to the API will move those search implementations into the plugin, to allow more efficient implementations, or implementations that don't have the whole tree in memory all the time. |