return NULL;
}
+list_t *list_sort(list_t *list, int rev, int (*func)(void *a, void*b))
+{
+ if (list == NULL || list->next == NULL)
+ return list;
+
+ /* Split list */
+ list_t *sides[2] = {NULL, NULL};
+ for (int i = 0; list; i=(i+1)%2) {
+ list_t *head = list;
+ list = list->next;
+ head->next = sides[i];
+ sides[i] = head;
+ }
+
+ /* Sort sides */
+ sides[0] = list_sort(sides[0], !rev, func);
+ sides[1] = list_sort(sides[1], !rev, func);
+
+ /* Merge sides */
+ while (sides[0] || sides[1]) {
+ int i = sides[0] == NULL ? 1 :
+ sides[1] == NULL ? 0 :
+ func(sides[0]->data,
+ sides[1]->data) > 0 ? !!rev : !rev;
+ list_t *head = sides[i];
+ sides[i] = sides[i]->next;
+ head->next = list;
+ head->prev = NULL;
+ if (list)
+ list->prev = head;
+ list = head;
+ }
+ return list;
+}
+
/* Misc */
int str2num(char *str, int def)
{
list_t *list_find(list_t *list, void *data);
+list_t *list_sort(list_t *list, int rev, int (*func)(void*,void*));
+
/* Misc */
int str2num(char *str, int def);
/********************
* Helper functions *
********************/
+static int sort_win(void *a, void *b)
+{
+ return ((win_t*)a)->x > ((win_t*)b)->x ? 1 :
+ ((win_t*)a)->x < ((win_t*)b)->x ? -1 : 0;
+}
+
static win_t *get_focus(void)
{
if (!wm_tag || !wm_dpy)
MARGIN = conf_get_int("main.margin", MARGIN);
STACK = conf_get_int("main.stack", STACK);
- /* Hack, fix screen order */
- list_t *screens = sys_info(root);
- list_t *left = screens;
- list_t *right = screens->next;
- if (left && right && WIN(left)->x > WIN(right)->x) {
- void *tmp = left->data;
- left->data = right->data;
- right->data = tmp;
- }
-
wm = new0(wm_t);
wm->root = root;
- wm->screens = screens;
+ wm->screens = list_sort(sys_info(root), 0, sort_win);
wm->tag = tag_new(wm->screens, 1);
wm->tags = list_insert(NULL, wm->tag);