Revert prior attempted optimisation. Gridding the land pays in some situations, but not all. Restricting to an upper bound might help, but overall, seems too fuzzy to be worth it. On one side is increased cost of Add/Delete + extra test on collision check, on the other is skipping the list iteration. Perhaps for large lists.
/*
* OpenAL Bridge - a simple portable library for OpenAL interface
* Copyright (c) 2009 Vittorio Giovara <vittorio.giovara@gmail.com>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation; version 2 of the License
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*/
#ifndef _OALB_INTERFACE_H
#define _OALB_INTERFACE_H
#include "openalbridge_t.h"
#include "commands.h"
#ifdef __CPLUSPLUS
extern "C" {
#endif
// init audio context and allocate memory
int openal_init (void);
// close audio subsytem and free memory
void openal_close (void);
// check if openal_init has been called
char openal_ready (void);
// load an audio file into memory and map it to abuffer
int openal_loadfile (const char *filename);
// unloads data from memory and marks a free spot
void openal_unloadfile (unsigned int index);
/******* other functions continue in commands.h *******/
#ifdef __CPLUSPLUS
}
#endif
#endif /*_OALB_INTERFACE_H*/