pq_utils.c

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   pq_utils.c                                         :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: dporhomo <dporhomo@student.42prague.com    +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2026/06/06 12:13:37 by dporhomo          #+#    #+#             */
/*   Updated: 2026/06/15 14:42:05 by dporhomo         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

/*Performs pq compare, swap and free*/

#include "codexion.h"

void	pq_free(t_pqueue *pq)
{
	if (pq && pq->heap)
	{
		free(pq->heap);
		pq->heap = NULL;
	}
}

void	pq_swap(t_pqueue *pq, int i, int j)
{
	t_request	tmp;

	tmp = pq->heap[i];
	pq->heap[i] = pq->heap[j];
	pq->heap[j] = tmp;
}

/* Returns 1 if heap[i] has higher priority than heap[j]*/
int	pq_compare(t_pqueue *pq, int i, int j)
{
	if (pq->is_edf)
	{
		if (pq->heap[i].deadline != pq->heap[j].deadline)
			return (pq->heap[i].deadline < pq->heap[j].deadline);
	}
	return (pq->heap[i].req_time < pq->heap[j].req_time);
}