mirror of
https://github.com/Unidata/netcdf-c.git
synced 2024-11-27 07:30:33 +08:00
171 lines
3.4 KiB
C
171 lines
3.4 KiB
C
/* Copyright 2009, UCAR/Unidata and OPeNDAP, Inc.
|
|
See the COPYRIGHT file for more information. */
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
#include "config.h"
|
|
#endif
|
|
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
|
|
#include "oclist.h"
|
|
|
|
static ocelem ocDATANULL = (ocelem)0;
|
|
/*static int ocinitialized=0;*/
|
|
|
|
int oclistnull(ocelem e) {return e == ocDATANULL;}
|
|
|
|
#ifndef TRUE
|
|
#define TRUE 1
|
|
#endif
|
|
#ifndef FALSE
|
|
#define FALSE 0
|
|
#endif
|
|
|
|
#define DEFAULTALLOC 16
|
|
#define ALLOCINCR 16
|
|
|
|
OClist* oclistnew(void)
|
|
{
|
|
OClist* l;
|
|
/*
|
|
if(!ocinitialized) {
|
|
memset((void*)&ocDATANULL,0,sizeof(ocelem));
|
|
ocinitialized = 1;
|
|
}
|
|
*/
|
|
l = (OClist*)malloc(sizeof(OClist));
|
|
if(l) {
|
|
l->alloc=0;
|
|
l->length=0;
|
|
l->content=NULL;
|
|
}
|
|
return l;
|
|
}
|
|
|
|
int
|
|
oclistfree(OClist* l)
|
|
{
|
|
if(l) {
|
|
l->alloc = 0;
|
|
if(l->content != NULL) {free(l->content); l->content = NULL;}
|
|
free(l);
|
|
}
|
|
return TRUE;
|
|
}
|
|
|
|
int
|
|
oclistsetalloc(OClist* l, unsigned int sz)
|
|
{
|
|
ocelem* newcontent;
|
|
if(l == NULL) return FALSE;
|
|
if(sz <= 0) {sz = (l->length?2*l->length:DEFAULTALLOC);}
|
|
if(l->alloc >= sz) {return TRUE;}
|
|
newcontent=(ocelem*)calloc(sz,sizeof(ocelem));
|
|
if(l->alloc > 0 && l->length > 0 && l->content != NULL) {
|
|
memcpy((void*)newcontent,(void*)l->content,sizeof(ocelem)*l->length);
|
|
free(l->content);
|
|
}
|
|
l->content=newcontent;
|
|
l->alloc=sz;
|
|
return TRUE;
|
|
}
|
|
|
|
int
|
|
oclistsetlength(OClist* l, unsigned int sz)
|
|
{
|
|
if(l == NULL) return FALSE;
|
|
if(sz > l->alloc && !oclistsetalloc(l,sz)) return FALSE;
|
|
l->length = sz;
|
|
return TRUE;
|
|
}
|
|
|
|
ocelem
|
|
oclistget(OClist* l, unsigned int index)
|
|
{
|
|
if(l == NULL || l->length == 0) return ocDATANULL;
|
|
if(index >= l->length) return ocDATANULL;
|
|
return l->content[index];
|
|
}
|
|
|
|
int
|
|
oclistset(OClist* l, unsigned int index, ocelem elem)
|
|
{
|
|
if(l == NULL) return FALSE;
|
|
if(index >= l->length) return FALSE;
|
|
l->content[index] = elem;
|
|
return TRUE;
|
|
}
|
|
|
|
/* Insert at position i of l; will push up elements i..|seq|. */
|
|
int
|
|
oclistinsert(OClist* l, unsigned int index, ocelem elem)
|
|
{
|
|
unsigned int i;
|
|
if(l == NULL) return FALSE;
|
|
if(index > l->length) return FALSE;
|
|
oclistsetalloc(l,0);
|
|
for(i=l->length;i>index;i--) l->content[i] = l->content[i-1];
|
|
l->content[index] = elem;
|
|
l->length++;
|
|
return TRUE;
|
|
}
|
|
|
|
int
|
|
oclistpush(OClist* l, ocelem elem)
|
|
{
|
|
if(l == NULL) return FALSE;
|
|
if(l->length >= l->alloc) oclistsetalloc(l,0);
|
|
l->content[l->length] = elem;
|
|
l->length++;
|
|
return TRUE;
|
|
}
|
|
|
|
ocelem
|
|
oclistpop(OClist* l)
|
|
{
|
|
if(l == NULL || l->length == 0) return ocDATANULL;
|
|
l->length--;
|
|
return l->content[l->length];
|
|
}
|
|
|
|
ocelem
|
|
oclisttop(OClist* l)
|
|
{
|
|
if(l == NULL || l->length == 0) return ocDATANULL;
|
|
return l->content[l->length - 1];
|
|
}
|
|
|
|
ocelem
|
|
oclistremove(OClist* l, unsigned int i)
|
|
{
|
|
unsigned int len;
|
|
ocelem elem;
|
|
if(l == NULL || (len=l->length) == 0) return ocDATANULL;
|
|
if(i >= len) return ocDATANULL;
|
|
elem = l->content[i];
|
|
for(i++;i<len;i++) l->content[i-1] = l->content[i];
|
|
l->length--;
|
|
return elem;
|
|
}
|
|
|
|
/* Duplicate and return the content (null terminate) */
|
|
ocelem*
|
|
oclistdup(OClist* l)
|
|
{
|
|
ocelem* result = (ocelem*)malloc(sizeof(ocelem)*(l->length+1));
|
|
memcpy((void*)result,(void*)l->content,sizeof(ocelem)*l->length);
|
|
result[l->length] = (ocelem)0;
|
|
return result;
|
|
}
|
|
|
|
int
|
|
oclistcontains(OClist* list, ocelem elem)
|
|
{
|
|
unsigned int i;
|
|
for(i=0;i<oclistlength(list);i++) {
|
|
if(elem == oclistget(list,i)) return 1;
|
|
}
|
|
return 0;
|
|
}
|