2 * A* Search - A search library used in Empire to determine paths between
4 * Copyright (C) 1990-1998 Phil Lapsley
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
27 * Return a pointer to the as_queue structure associated with
28 * this coordinate if the coordinate is in the queue.
31 as_iscinq(struct as_data *adp, struct as_coord c)
36 hashval = adp->hash(c) % adp->hashsize;
38 for (hp = adp->hashtab[hashval]; hp; hp = hp->next)
39 if (hp->c.x == c.x && hp->c.y == c.y)
46 * Set the queue structure associated with this coordinate.
49 as_setcinq(struct as_data *adp, struct as_coord c, struct as_queue *qp)
55 new = (struct as_hash *)malloc(sizeof(struct as_hash));
59 hashval = adp->hash(c) % adp->hashsize;
60 hp = adp->hashtab[hashval];
62 new->next = (hp) ? hp : NULL;
63 adp->hashtab[hashval] = new;
67 * Walk down the hash table array, freeing the chains and zeroing
71 as_free_hashtab(struct as_data *adp)
74 struct as_hash *hp, *hp2;
76 for (i = 0; i < adp->hashsize; i++) {
77 for (hp = adp->hashtab[i]; hp; hp = hp2) {
81 adp->hashtab[i] = NULL;