/*
 * action-stack.h -- convenient stack of actions
 *
 * Copyright (c) 2020-2022 David Demelier <markand@malikania.fr>
 *
 * Permission to use, copy, modify, and/or distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

#ifndef MLK_CORE_ACTION_STACK_H
#define MLK_CORE_ACTION_STACK_H

#include "core.h"

#define ACTION_STACK_MAX (128)

union event;

struct action_stack {
	struct action *actions[ACTION_STACK_MAX];
};

CORE_BEGIN_DECLS

void
action_stack_init(struct action_stack *);

int
action_stack_add(struct action_stack *, struct action *);

void
action_stack_handle(struct action_stack *, const union event *);

int
action_stack_update(struct action_stack *, unsigned int);

void
action_stack_draw(const struct action_stack *);

int
action_stack_completed(const struct action_stack *);

void
action_stack_finish(struct action_stack *);

CORE_END_DECLS

#endif /* !MLK_CORE_ACTION_STACK_H */