⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 cparray.c

📁 Compressed file has password
💻 C
字号:
/* Copyright (c) 2007 Scott Lembcke *  * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: *  * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. *  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE * SOFTWARE. */ #include <stdlib.h>#include <string.h>#include "chipmunk.h"//#define CP_ARRAY_INCREMENT 10// NOTE: cpArray is rarely used and will probably go away.cpArray*cpArrayAlloc(void){	return (cpArray *)calloc(1, sizeof(cpArray));}cpArray*cpArrayInit(cpArray *arr, int size){	arr->num = 0;		size = (size ? size : 4);	arr->max = size;	arr->arr = (void **)malloc(size*sizeof(void**));		return arr;}cpArray*cpArrayNew(int size){	return cpArrayInit(cpArrayAlloc(), size);}voidcpArrayDestroy(cpArray *arr){	free(arr->arr);}voidcpArrayFree(cpArray *arr){	if(!arr) return;	cpArrayDestroy(arr);	free(arr);}voidcpArrayPush(cpArray *arr, void *object){	if(arr->num == arr->max){		arr->max *= 2;		arr->arr = (void **)realloc(arr->arr, arr->max*sizeof(void**));	}		arr->arr[arr->num] = object;	arr->num++;}voidcpArrayDeleteIndex(cpArray *arr, int index){	int last = --arr->num;	arr->arr[index] = arr->arr[last];}voidcpArrayDeleteObj(cpArray *arr, void *obj){	for(int i=0; i<arr->num; i++){		if(arr->arr[i] == obj){			cpArrayDeleteIndex(arr, i);			return;		}	}}voidcpArrayEach(cpArray *arr, cpArrayIter iterFunc, void *data){	for(int i=0; i<arr->num; i++)		iterFunc(arr->arr[i], data);}intcpArrayContains(cpArray *arr, void *ptr){	for(int i=0; i<arr->num; i++)		if(arr->arr[i] == ptr) return 1;		return 0;}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -