hlfw.ca

binpack

ref: 3098cb43c056b90b56247b6b313e0e3c98a1b417
dir: /bin_utils.c/

View raw version
#include <stdio.h>
#include <stdlib.h>

#include "binpack.h"

// center all windows on given screen
void center(unsigned width, unsigned height, struct Output out[], unsigned gaps) {
	// r = rightmost edge of bins
	// d = bottommost edge of bins
	// Move all windows (width - r) / 2
	// Move all windows (height - d) / 2
	// g = gaps / 2
	// x - g, y + g, w - g, h - g for all windows 
}

// sort our input
void sort_bins(struct Input r[], const size_t length) {
	/* arrange rectangles largest to smallest, normalized some over min/max */
	struct Input temp;
	for (size_t i = 1; i < length; i++) {
		for (size_t j = 0; j < length - i; j++) {
			if ((r[j + 1].maxw * r[j + 1].minh) > (r[j].maxw * r[j].minh)) {
				temp = r[j];
				r[j] = r[j + 1];
				r[j + 1] = temp;
			}
		}
	}
}

// read from stdin, setting up our initial data
size_t init_bins(struct Input r[]) {
	size_t length = 0;
	char line[MAX_BIN];
	for (unsigned i = 0; fgets(line, sizeof(line), stdin); ++i) {
		sscanf(line, "%d %d %d %d %lx", &r[i].minw, &r[i].minh, &r[i].maxw, &r[i].maxh, &r[i].wid
);
		length++;
	}
	return length;
}

// given in[], seperate by even and odd into a[] and b[]
void split(struct Input in[], struct Input a[], struct Input b[], size_t length) {
	
}

// Add w width to each out[n].x (moving the window on to the next monitor)
void offset(struct Output out[], unsigned w) {
	
}

// Loop through a given bin, printing all to stdout if values are present
void print_bin(struct Output out[], size_t length) {
	for (size_t i=0; i < length; i++) {
		if (out[i].w > 0 && out[i].h > 0) {
			printf("%d %d %d %d %lx\n", out[i].x, out[i].y, out[i].w, out[i].h, out[i].wid);
		}
    }
}

// Remove element from array, returning it for use 
struct Input pop(struct Input in[]) {
	size_t len = sizeof(*in)/sizeof(in[0]);
	struct Input temp = in[1];
	for (size_t i = 1; i < len - 1; i++) {
		in[i] = in[i+1];
	}
	in[len].minw = 0;
	in[len].maxw = 0;
	in[len].minh = 0;
	in[len].maxh = 0;
	in[len].wid  = 0;
	return temp;
}

// append element on to array
void push(struct Input in[], struct Input temp) {
	size_t len = sizeof(*in)/sizeof(in[0]);
	in[len] = temp;
}