move_right.c

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   move_right.c                                       :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: dskrypny <marvin@42.fr>                    +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2018/07/21 19:31:08 by dskrypny          #+#    #+#             */
/*   Updated: 2018/07/22 17:28:09 by dskrypny         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "header.h"

static short	find_pair_right(int mas[4][4], int x, int y)
{
	short	step;

	step = 1;
	while ((x - step) >= 0 && mas[x - step][y] == 0)
		step++;
	if ((x - step >= 0) && mas[x - step][y] == mas[x][y])
	{
		mas[x][y] *= 2;
		mas[x - step][y] = 0;
		return (mas[x][y]);
	}
	return (0);
}

static void		push_all_right(int mas[4][4], int *x)
{
	short	step;
	short	i;
	short	j;

	i = 4;
	while (--i >= 0)
	{
		j = -1;
		while (++j < 4)
		{
			step = 0;
			if (mas[i][j] == 0)
				while (i - step >= 0 && !mas[i - step][j])
					step++;
			if (step && i - step >= 0)
			{
				mas[i][j] = mas[i - step][j];
				mas[i - step][j] = 0;
				*x += 1;
			}
		}
	}
}

int				move_right(int mas[4][4], t_result *res)
{
	short	i;
	short	j;
	int		x;

	x = 0;
	i = 4;
	while (--i >= 0)
	{
		j = -1;
		while (++j < 4)
		{
			if (mas[i][j] != 0)
				x += find_pair_right(mas, i, j);
		}
	}
	res->result += x;
	push_all_right(mas, &x);
	print_result(res);
	return (x);
}