b4b381e947
For that matter, use elements as a filter for elements we care about, and let the hook implement whatever it needs without duplicating everything. The resulting algorithm is still O(n²) where n is the number of filtered elements (3 at most right now), which isn't bad if we don't need to get too many elements, but at least it's not quadratic in the number of attributes anymore. Speedup improvements could be done using gperf btw. Signed-off-by: Pierre Habouzit <madcoder@debian.org> |
||
|---|---|---|
| .. | ||
| graph.c | ||
| iconbox.c | ||
| progressbar.c | ||
| systray.c | ||
| taglist.c | ||
| tasklist.c | ||
| textbox.c | ||