From 2389bd7bedc9b1caf3e9f34631c70c8ddf3fb306 Mon Sep 17 00:00:00 2001 From: Federico Mena Quintero Date: Thu, 8 Oct 1998 17:19:43 +0000 Subject: Do some cleanup; now we pass a struct with the layout algorithm's state 1998-10-08 Federico Mena Quintero * layout.c: Do some cleanup; now we pass a struct with the layout algorithm's state instead of passing a trillion parameters around. * gncal-full-day.c (layout_children): Use the new generic layout engine. (child_compare): Sort keys are start time then end time, not just start time. This produces somewhat nicer results for the layout algorithm. The new layout code uses a partition of the time range occupied by the events, rather than using a fixed time granularity. This is better since the different parts of the program that use the layout module will have different semantics regarding snapping the event bounds to a fixed "time grid". svn path=/trunk/; revision=434 --- calendar/ChangeLog | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) (limited to 'calendar/ChangeLog') diff --git a/calendar/ChangeLog b/calendar/ChangeLog index 2012f7155d..4bb47d706f 100644 --- a/calendar/ChangeLog +++ b/calendar/ChangeLog @@ -1,3 +1,20 @@ +1998-10-08 Federico Mena Quintero + + * layout.c: Do some cleanup; now we pass a struct with the layout + algorithm's state instead of passing a trillion parameters around. + + * gncal-full-day.c (layout_children): Use the new generic layout + engine. + (child_compare): Sort keys are start time then end time, not just + start time. This produces somewhat nicer results for the layout + algorithm. + + The new layout code uses a partition of the time range occupied by + the events, rather than using a fixed time granularity. This is + better since the different parts of the program that use the + layout module will have different semantics regarding snapping the + event bounds to a fixed "time grid". + 1998-10-07 Federico Mena Quintero * layout.[ch]: New files that abstract the event layout code from -- cgit v1.2.3