Function stbrp__skyline_pack_rectangle

KBotExt/imgui/imstb_rectpack.h:447–525

}

static stbrp__findresult stbrp__skyline_pack_rectangle(stbrp_context* context, int width, int height)
{
	// find best position according to heuristic
	stbrp__findresult res = stbrp__skyline_find_best_pos(context, width, height);
	stbrp_node* node, * cur;

	// bail if:
	//    1. it failed
	//    2. the best node doesn't fit (we don't always check this)
	//    3. we're out of memory
	if (res.prev_link == NULL || res.y + height > context->height || context->free_head == NULL) {
		res.prev_link = NULL;
		return res;
	}

	// on success, create new node
	node = context->free_head;
	node->x = (stbrp_coord)res.x;
	node->y = (stbrp_coord)(res.y + height);

	context->free_head = node->next;

	// insert the new node into the right starting point, and
	// let 'cur' point to the remaining nodes needing to be
	// stiched back in

	cur = *res.prev_link;
	if (cur->x < res.x) {
		// preserve the existing one, so start testing with the next one
		stbrp_node* next = cur->next;
		cur->next = node;
		cur = next;
	}
	else {
		*res.prev_link = node;
	}

	// from here, traverse cur and free the nodes, until we get to one
	// that shouldn't be freed
	while (cur->next && cur->next->x <= res.x + width) {
		stbrp_node* next = cur->next;
		// move the current node to the free list
		cur->next = context->free_head;
		context->free_head = cur;
		cur = next;
	}

	// stitch the list back in
	node->next = cur;

	if (cur->x < res.x + width)
		cur->x = (stbrp_coord)(res.x + width);

#ifdef _DEBUG
	cur = context->active_head;
	while (cur->x < context->width) {
		STBRP_ASSERT(cur->x < cur->next->x);
		cur = cur->next;