Re: Milestones document

[Elliot Lee <sopwith redhat com>]

On Wed, 8 Dec 1999, Jim Gettys wrote:

> For example, the next time you break library binary compatibility, you 
> go through all data structures and sort the structure elements small to 
> large, (often with subunits of information that ought to be local in a 
> cache line)

Small to large or large to small? (Or does it make a diff as long as it is
sorted?)

This also may not help as much as theoretically possible, because of the
structure concatenation used for inheritance in Gtk+.

I was looking at gnome-libs, and while there are some nice places to
reduce memory, a lot of the structure elements are pointers, for which no
improvement is possible.

-- Elliot
Rome did not create a great empire by having meetings, they did it by
killing all who opposed them.