lp://qastaging/~kamstrup/dee/sorted

Branch merges

Propose for merging

No branches dependent on this one.

Merged into lp://qastaging/dee at revision 334

Michal Hruby (community): Approve on 2012-01-09

Diff: 1441 lines (+775/-228)

13 files modified

bindings/python/Dee.py (+6/-0)
src/dee-file-resource-manager.c (+0/-1)
src/dee-filter-model.c (+86/-0)
src/dee-filter.c (+125/-170)
src/dee-filter.h (+5/-0)
src/dee-model.c (+180/-0)
src/dee-model.h (+49/-0)
src/dee-sequence-model.c (+74/-43)
src/dee-serializable-model.c (+70/-0)
tests/test-benchmark.c (+76/-14)
tests/test-model-rows.c (+95/-0)
vapi/Dee-1.0.metadata (+2/-0)
vapi/dee-1.0.vapi (+7/-0)

api

Related source package recipes

No recipes using this branch. (?)

Create packaging recipe

Related snap packages

Related bugs

Bug #913128: DeeModel support insert_sorted() and find_sorted()

High

Fix Released

Link a bug report

Related blueprints

344. By Mikkel Kamstrup Erlandsen on 2012-01-09

Add missing gtk-doc and annotations for gir/vapi

343. By Mikkel Kamstrup Erlandsen on 2012-01-09

Include dee_model_insert_sorted() varargs variant in .vapi

342. By Mikkel Kamstrup Erlandsen on 2012-01-09

Add a benchmark for sorted inserts straight on a DeeSequenceModel

341. By Mikkel Kamstrup Erlandsen on 2012-01-09

Use random uints to sort by in the uint sorting benchmark. The sequential uints we used before could potentially consistenly trigger best- or worst case scenarios.

340. By Mikkel Kamstrup Erlandsen on 2012-01-09

Add specialized Python methods to access Dee.Model.insert_sorted() and Dee.Model.find_sorted() with varargs. Also update the VAPI now that we're at it

339. By Mikkel Kamstrup Erlandsen on 2012-01-09

Remove illegal unref of externalized variant in dee_file_resource_manager_load(). This was causing test failures in the glib from Precise.

338. By Mikkel Kamstrup Erlandsen on 2012-01-09

Add benchmark for new sorting algorithms that sorts on a uint32 column. This way we cna measure the overhead of collator sorting and straight old integer sorting.

The results are down putting: The new logN sorting is not measurably faster and uint sorting is not faster than collator based sorting. This seems to imply that the full overhead of sorting is something other than N... ?!

337. By Mikkel Kamstrup Erlandsen on 2012-01-09

Implement a new DeeFilter dee_filter_new_sort() that sorts a model by a DeeCompareRowFunc. Port collator filters to use the new generic sort filter under the hood. This should optimize sorted inserts to logN instead N and construction of fully sorted models to NlogN from N^2.

336. By Mikkel Kamstrup Erlandsen on 2012-01-09

Implement logN insert_row_sorted() in DeeFilterModel

335. By Mikkel Kamstrup Erlandsen on 2012-01-09

Don't use GPtrArray to store rows in DeeSequenceModel. Just a plain array of gpointers. It's easier and faster anyway - and relevant for the sorting branch - it works more easily with sorting GSequences.

Inverts sorting logic to match semantics of GSequence.