push.c

Client *
nextc(Client *c, float f) {
	if(!f)
		return nexttiled(c);

	for(; c && !ISVISIBLE(c); c = c->next);
	return c;
}

static Client *
prevc(Client *c, float f) {
	Client *p, *r;

	for(p = selmon->clients, r = NULL; c && p && p != c; p = p->next)
		if((f || !p->isfloating) && ISVISIBLE(p))
			r = p;
	return r;
}

// get amount of tiled clients
int clientcount()
{
	return clientcountmon(selmon);
}

int clientcountmon(Monitor *m)
{
	int n;
	Client *c;
	for (n = 0, c = nexttiled(m->clients); c; c = nexttiled(c->next), n++);
	return n;
}

int allclientcount()
{
	int n;
	Client *c;
	n = 0;
	for (c = selmon->clients; c; c = c->next) {
		if (c == selmon->overlay)
			continue;
		n++;
	}
	return n;
}

int clientdistance(Client *c, Client *c2) {
	int x, y, distance;
	x = abs(((c->x + c->w) / 2) - ((c2->x + c->w) / 2));
	y = abs(((c->y + c->h) / 2) - ((c2->y + c->h) / 2));
	
	distance = (sqrt(y*y+x*x));
	return distance;

}

static void
pushup(const Arg *arg) {
	Client *sel = selmon->sel;
	Client *c;
	if (clientcount() < 2) {
		return;
	}
	
	if(!sel || (sel->isfloating && !arg->f))
		return;
	if((c = prevc(sel, arg->f))) {
		/* attach before c */
		detach(sel);
		sel->next = c;
		if(selmon->clients == c)
			selmon->clients = sel;
		else {
			for(c = selmon->clients; c->next != sel->next; c = c->next);
			c->next = sel;
		}
	} else {
		/* move to the end */
		for(c = sel; c->next; c = c->next);
		detach(sel);
		sel->next = NULL;
		c->next = sel;
	}
	focus(sel);
	arrange(selmon);
}

static void
pushdown(const Arg *arg) {
	Client *sel = selmon->sel;
	Client *c;
	
	if (clientcount() < 2) {
		return;
	}

	if(!sel || (sel->isfloating && !arg->f))
		return;
	if((c = nextc(sel->next, arg->f))) {
		/* attach after c */
		detach(sel);
		sel->next = c->next;
		c->next = sel;
	} else {
		/* move to the front */
		detach(sel);
		attach(sel);
	}
	focus(sel);
	arrange(selmon);
}