1 /* rrsolve - Simple RR solver and librr client.
3 * Copyright © 2003 Carl Worth
5 * Permission to use, copy, modify, distribute, and sell this software
6 * and its documentation for any purpose is hereby granted without
7 * fee, provided that the above copyright notice appear in all copies
8 * and that both that copyright notice and this permission notice
9 * appear in supporting documentation, and that the name of Carl Worth
10 * not be used in advertising or publicity pertaining to distribution
11 * of the software without specific, written prior permission.
12 * Carl Worth makes no representations about the suitability of this
13 * software for any purpose. It is provided "as is" without express
14 * or implied warranty.
16 * CARL WORTH DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
17 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN
18 * NO EVENT SHALL CARL WORTH BE LIABLE FOR ANY SPECIAL, INDIRECT OR
19 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
20 * OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
21 * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
22 * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
24 * Author: Carl Worth <carl@theworths.org>
33 rrs_solution_init (rrs_solution_t *solution)
35 solution->move = NULL;
37 solution->num_moves = 0;
39 return RR_STATUS_SUCCESS;
43 rrs_solution_fini (rrs_solution_t *solution)
45 free (solution->move);
46 solution->move = NULL;
48 solution->num_moves = 0;
51 #define RRS_SOLUTION_GROWTH 5
53 _rrs_solution_grow (rrs_solution_t *solution)
57 if (solution->num_moves >= solution->size) {
58 solution->size += RRS_SOLUTION_GROWTH;
59 new_move = realloc (solution->move, solution->size * sizeof (rrs_move_t));
60 if (new_move == NULL) {
61 solution->size -= RRS_SOLUTION_GROWTH;
62 return RR_STATUS_NO_MEMORY;
64 solution->move = new_move;
67 return RR_STATUS_SUCCESS;
71 rrs_solution_push (rrs_solution_t *solution,
72 rr_robot_t robot, rr_direction_t dir)
76 _rrs_solution_grow (solution);
78 move = &solution->move[solution->num_moves++];
82 return RR_STATUS_SUCCESS;
86 rrs_solution_pop (rrs_solution_t *solution,
87 rr_robot_t *robot, rr_direction_t *dir)
91 if (solution->num_moves < 1)
92 return RR_STATUS_HISTORY_EMPTY;
94 move = &solution->move[--solution->num_moves];
101 return RR_STATUS_SUCCESS;
105 rrs_solution_prepend (rrs_solution_t *solution,
106 rr_robot_t robot, rr_direction_t dir)
110 _rrs_solution_grow (solution);
112 memmove (&solution->move[1], &solution->move[0],
113 solution->num_moves * sizeof (rrs_move_t));
114 move = &solution->move[0];
117 solution->num_moves++;
119 return RR_STATUS_SUCCESS;