diff options
| author | Federico Mena Quintero <federico@nuclecu.unam.mx> | 1998-10-09 01:19:43 +0800 |
|---|---|---|
| committer | Arturo Espinosa <unammx@src.gnome.org> | 1998-10-09 01:19:43 +0800 |
| commit | 2389bd7bedc9b1caf3e9f34631c70c8ddf3fb306 (patch) | |
| tree | 92b63256b47a7c61141ea2fecdb6fabf28d7e96b /calendar/ChangeLog | |
| parent | 3b1a500fd323b3f3908477f3df66f1ab0ad7674b (diff) | |
| download | gsoc2013-evolution-2389bd7bedc9b1caf3e9f34631c70c8ddf3fb306.tar.gz gsoc2013-evolution-2389bd7bedc9b1caf3e9f34631c70c8ddf3fb306.tar.zst gsoc2013-evolution-2389bd7bedc9b1caf3e9f34631c70c8ddf3fb306.zip | |
Do some cleanup; now we pass a struct with the layout algorithm's state
1998-10-08 Federico Mena Quintero <federico@nuclecu.unam.mx>
* 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
Diffstat (limited to 'calendar/ChangeLog')
| -rw-r--r-- | calendar/ChangeLog | 17 |
1 files changed, 17 insertions, 0 deletions
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 <federico@nuclecu.unam.mx> + + * 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 <federico@nuclecu.unam.mx> * layout.[ch]: New files that abstract the event layout code from |