./CVector-1.0.3.1/0000755000076500001200000000000011437460235012171 5ustar yayaadmin./CVector-1.0.3.1/CVector.c0000644000076500001200000003156211437457040013711 0ustar yayaadmin/* * CVector.c * CVector * * Created by Herbert J. Bernstein on 11/28/08. * Copyright 2008 Herbert J. Bernstein. All rights reserved. * */ /********************************************************************** * * * YOU MAY REDISTRIBUTE THE CVector API UNDER THE TERMS OF THE LGPL * * * **********************************************************************/ /************************* LGPL NOTICES ******************************* * * * This library 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; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library 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 library; if not, write to the Free * * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, * * MA 02110-1301 USA * * * **********************************************************************/ #ifdef __cplusplus extern "C" { #endif #ifdef USE_LOCAL_HEADERS #include "CVector.h" #else #include #endif /* CVectorCreate -- create a generic vector */ int CVectorCreate(CVectorHandle CVECTOR_FAR * vectorhandle, const size_t elementsize, const size_t capacity) { size_t cap = capacity; if ((vectorhandle==NULL)) { return CVECTOR_BAD_ARGUMENT; } *vectorhandle = (CVectorHandle)CVECTOR_MALLOC(sizeof(CVector)); if ((*vectorhandle==NULL)) { return CVECTOR_MALLOC_FAILED; } (*vectorhandle)->size = 0; (*vectorhandle)->flags = 0; (*vectorhandle)->capacity = 0; (*vectorhandle)->elementsize = elementsize; if (!cap) { cap = 10; } (*vectorhandle)->array = (void CVECTOR_FAR *)CVECTOR_MALLOC(cap*elementsize); if ((*vectorhandle)->array) { (*vectorhandle)->capacity = cap; return 0; } CVECTOR_FREE(*vectorhandle); *vectorhandle = NULL; return CVECTOR_MALLOC_FAILED; } /* CVectorAddElement -- add an element to a generic vector equivalent to vector::push_back */ int CVectorAddElement(const CVectorHandle vectorhandle, const void CVECTOR_FAR * element) { size_t newcap; int errorcode; if ((vectorhandle==NULL)) { return CVECTOR_BAD_ARGUMENT; } if ( (vectorhandle->flags&CVECTOR_FLAGS_NO_RESIZE) ) { return CVECTOR_NO_RESIZE; } if (vectorhandle->size >= vectorhandle->capacity) { newcap = vectorhandle->capacity*2; if (newcap < 1) { newcap = 1; } errorcode = CVectorSetCapacity (vectorhandle, newcap); if (errorcode != 0) { newcap = vectorhandle->capacity+(size_t)(vectorhandle->capacity>>2); if (newcap < 1) { newcap = 1; } errorcode = CVectorSetCapacity (vectorhandle, newcap); if (errorcode != 0) { return errorcode; } } } CVECTOR_MEMMOVE(((char CVECTOR_FAR *)(vectorhandle->array))+vectorhandle->size*vectorhandle->elementsize, (const char CVECTOR_FAR *)element, vectorhandle->elementsize); vectorhandle->size ++; return 0; } /* CVectorGetElement -- get a copy of an element from a generic vector */ int CVectorGetElement(const CVectorHandle vectorhandle, void CVECTOR_FAR * element, const size_t index) { if ((vectorhandle==NULL)) { return CVECTOR_BAD_ARGUMENT; } if (index >= 0 && index < vectorhandle->size) { CVECTOR_MEMMOVE((char *)element,((char *)(vectorhandle->array))+index*vectorhandle->elementsize, vectorhandle->elementsize); return 0; } else { return CVECTOR_NOT_FOUND; } } /* CVectorGetElementptr -- get a pointer to an element from a generic vector */ int CVectorGetElementptr(const CVectorHandle vectorhandle, void CVECTOR_FAR ** elementptr, const size_t index) { if ((vectorhandle==NULL)) { return CVECTOR_BAD_ARGUMENT; } if (index >= 0 && index < vectorhandle->size) { *elementptr = (void CVECTOR_FAR*)(((char *)(vectorhandle->array))+index*vectorhandle->elementsize); vectorhandle->flags |= CVECTOR_FLAGS_NO_RELOCATION; return 0; } else { return CVECTOR_NOT_FOUND; } } /* CVectorSetElement -- set a copy of an element into a generic vector */ int CVectorSetElement(const CVectorHandle vectorhandle, const void CVECTOR_FAR * element, const size_t index) { size_t newcap; int errorcode; if ((vectorhandle==NULL) ) { return CVECTOR_BAD_ARGUMENT; } if (index >= vectorhandle->capacity) { newcap = index+vectorhandle->capacity+1; errorcode = CVectorSetCapacity(vectorhandle, newcap); if (errorcode != 0 ) { newcap = index*1.2; if (newcap < index+128) { newcap = index+128; } errorcode = CVectorSetCapacity(vectorhandle, newcap); if (errorcode != 0) { return errorcode; } } } if (index >= 0 && index < vectorhandle->capacity) { CVECTOR_MEMMOVE(((char *)(vectorhandle->array))+index*vectorhandle->elementsize,(char *)element, vectorhandle->elementsize); if (index >= vectorhandle->size) { vectorhandle->size = index+1; } return 0; } else { return CVECTOR_NOT_FOUND; } } /* CVectorRemoveElement -- remove an element from a generic vector */ /* keeps elements 0 -- index-1, discards element index moves elements index+1 through vectorhandle->size-1 into element index through vectorhandle->size-2 i.e. moves characters (index+1)*(vectorhandle->elementsize) through (vectorhandle->size)*(vectorhandle->elementsize)-1 to index*(vectorhandle->elementsize) */ int CVectorRemoveElement(const CVectorHandle vectorhandle, const size_t index) { if ((vectorhandle==NULL)) { return CVECTOR_BAD_ARGUMENT; } if ((vectorhandle->flags&CVECTOR_FLAGS_NO_RELOCATION)) { return CVECTOR_NO_RELOCATION; } if (index >= vectorhandle->size || index < 0 ) { return CVECTOR_NOT_FOUND; } if (index == vectorhandle->size-1) { vectorhandle->size--; return 0; } CVECTOR_MEMMOVE((char *)vectorhandle->array+index*(vectorhandle->elementsize), (char *)vectorhandle->array+(index+1)*(vectorhandle->elementsize), (vectorhandle->size-1-index)*(vectorhandle->elementsize)); vectorhandle->size--; return 0; } /* CVectorClear -- clear a generic vector */ int CVectorClear(const CVectorHandle vectorhandle) { if ((vectorhandle==NULL)) { return CVECTOR_BAD_ARGUMENT; } if (vectorhandle->flags & CVECTOR_FLAGS_NO_RESIZE) { return CVECTOR_NO_RESIZE; } vectorhandle->size = 0; return 0; } /* CVectorFree -- remove a generic vector */ int CVectorFree(CVectorHandle CVECTOR_FAR * vectorhandle) { if ((vectorhandle==NULL)) { return CVECTOR_BAD_ARGUMENT; } if (*vectorhandle) { if ((*vectorhandle)->flags & CVECTOR_FLAGS_NO_RESIZE) { return CVECTOR_NO_RESIZE; } if ((*vectorhandle)->flags & CVECTOR_FLAGS_NO_RELOCATION) { return CVECTOR_NO_RELOCATION; } if ((*vectorhandle)->array) { CVECTOR_FREE((*vectorhandle)->array); } CVECTOR_FREE(*vectorhandle); } *vectorhandle = 0; return 0; } /* CVectorGetCapacity - function to return the CVector capacity */ int CVectorGetCapacity(const CVectorHandle vectorhandle, size_t CVECTOR_FAR * capacity) { if ((vectorhandle==NULL)||!(capacity)) { return CVECTOR_BAD_ARGUMENT; } *capacity = vectorhandle->capacity; return 0; } /* CVectorGetSize - function to return the CVector size */ int CVectorGetSize(const CVectorHandle vectorhandle, size_t CVECTOR_FAR * size) { if ((vectorhandle==NULL)||!(size)) { return CVECTOR_BAD_ARGUMENT; } *size = vectorhandle->size; return 0; } /* CVectorGetFlags - function to return the CVector flags */ int CVectorGetFlags(const CVectorHandle vectorhandle, unsigned int CVECTOR_FAR * flags) { if ((vectorhandle==NULL)||!(flags)) { return CVECTOR_BAD_ARGUMENT; } *flags = vectorhandle->flags; return 0; } /* CVectorSetCapacity - function to set the CVector capacity */ int CVectorSetCapacity(const CVectorHandle vectorhandle, const size_t capacity) { void CVECTOR_FAR * temparray; if ((vectorhandle==NULL) || capacity < vectorhandle->size) { return CVECTOR_BAD_ARGUMENT; } if (capacity == vectorhandle->capacity) { return 0; } if (vectorhandle->flags&CVECTOR_FLAGS_NO_RELOCATION) { return CVECTOR_NO_RELOCATION; } if (capacity) { temparray = CVECTOR_MALLOC(capacity*vectorhandle->elementsize); if (!temparray) { return CVECTOR_MALLOC_FAILED; } if (vectorhandle->size) { CVECTOR_MEMMOVE((char *)temparray, (char *)vectorhandle->array, vectorhandle->size*vectorhandle->elementsize); } CVECTOR_FREE(vectorhandle->array); } else { temparray = NULL; } vectorhandle->array = temparray; vectorhandle->capacity = capacity; return 0; } /* CVectorSetSize - function to set the CVector size */ int CVectorSetSize(const CVectorHandle vectorhandle, const size_t size) { int errorcode; if ((vectorhandle==NULL) ) { return CVECTOR_BAD_ARGUMENT; } if (size == vectorhandle->size) { return 0; } if ((vectorhandle->flags & CVECTOR_FLAGS_NO_RESIZE)) { return CVECTOR_NO_RESIZE; } if ( size > vectorhandle->capacity ) { if ((vectorhandle->flags & CVECTOR_FLAGS_NO_RELOCATION) ) { return CVECTOR_NO_RELOCATION; } errorcode = CVectorSetCapacity(vectorhandle,size); if (errorcode != 0) { return errorcode; } } if ( size <= vectorhandle->capacity ) { if (size > vectorhandle->size) { CVECTOR_MEMSET(((char *)vectorhandle->array)+(vectorhandle->size)*(vectorhandle->elementsize), 0, (vectorhandle->size-size)*(vectorhandle->elementsize)); } vectorhandle->size = size; } return 0; } /* CVectorSetFags - function to set the CVector flags */ int CVectorSetFlags(const CVectorHandle vectorhandle, const unsigned int flags) { if ((vectorhandle==NULL) ) { return CVECTOR_BAD_ARGUMENT; } vectorhandle->flags = flags; return 0; } #ifdef __cplusplus } #endif ./CVector-1.0.3.1/CVector.h0000644000076500001200000001353011437457040013711 0ustar yayaadmin/* * CVector.h * CVector * * Created by Herbert J. Bernstein on 11/28/08. * Copyright 2008 Herbert J. Bernstein. All rights reserved. * */ /********************************************************************** * * * YOU MAY REDISTRIBUTE THE CVector API UNDER THE TERMS OF THE LGPL * * * **********************************************************************/ /************************* LGPL NOTICES ******************************* * * * This library 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; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library 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 library; if not, write to the Free * * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, * * MA 02110-1301 USA * * * **********************************************************************/ #ifndef CVECTOR_H_INCLUDED #define CVECTOR_H_INCLUDED #ifdef __cplusplus extern "C" { #endif /* CVector flags */ #define CVECTOR_FLAGS_NO_RELOCATION 1 #define CVECTOR_FLAGS_NO_RESIZE 2 /* CVector error return values */ #define CVECTOR_MALLOC_FAILED -1 #define CVECTOR_BAD_ARGUMENT -2 #define CVECTOR_NOT_FOUND -4 #define CVECTOR_NO_RELOCATION -8 #define CVECTOR_NO_RESIZE -16 #ifdef CVECTOR_USE_FAR #include #include #define CVECTOR_FAR __far #define CVECTOR_MALLOC _fmalloc #define CVECTOR_FREE _ffree #define CVECTOR_MEMSET _fmemset #define CVECTOR_MEMMOVE _fmemmove #else #include #include #define CVECTOR_FAR #define CVECTOR_MALLOC malloc #define CVECTOR_FREE free #define CVECTOR_MEMSET memset #define CVECTOR_MEMMOVE memmove #endif typedef struct { size_t size; /* size of the vector */ size_t capacity; /* capacity of the vector */ size_t elementsize; /* size of an element */ void CVECTOR_FAR * array; /* the array of elements */ unsigned int flags; /* flags */ } CVector; typedef CVector CVECTOR_FAR * CVectorHandle; /* CVectorAddElement -- add an element to a CVector */ int CVectorAddElement(const CVectorHandle vectorhandle, const void CVECTOR_FAR * element); /* CVectorCapacity -- macro to return the CVector capacity */ #define CVectorCapacity(vectorhandle) (vectorhandle)->capacity /* CVectorClear -- clear a generic vector */ int CVectorClear(const CVectorHandle vectorhandle); /* CVectorCreate -- create a CVector */ int CVectorCreate(CVectorHandle CVECTOR_FAR * vectorhandle, const size_t elementsize, const size_t capacity); /* CVectorElementAt -- return the element at the given index as a void pointer without checking and without protection against relocation */ #define CVectorElementAt(vectorhandle,index) ((void CVECTOR_FAR *)(((char *)((vectorhandle)->array))+(index)*(vectorhandle)->elementsize)) /* CVectorFree -- remove a CVector */ int CVectorFree(CVectorHandle CVECTOR_FAR * vectorhandle); /* CVectorGetCapacity - function to return the CVector capacity */ int CVectorGetCapacity(const CVectorHandle vectorhandle, size_t CVECTOR_FAR * capacity); /* CVectorGetElement -- get a copy of an element from a CVector */ int CVectorGetElement(const CVectorHandle vectorhandle, void CVECTOR_FAR * element, const size_t index); /* CVectorGetElementptr -- get a pointer to an element from a CVector */ int CVectorGetElementptr(const CVectorHandle vectorhandle, void CVECTOR_FAR ** elementptr, const size_t index); /* CVectorGetFlags - function to return the CVector flags */ int CVectorGetFlags(const CVectorHandle vectorhandle, unsigned int CVECTOR_FAR * flags); /* CVectorGetSize - function to return the CVector size */ int CVectorGetSize(const CVectorHandle vectorhandle, size_t CVECTOR_FAR * size); /* CVectorRemoveElement -- remove an element from a generic vector */ int CVectorRemoveElement(const CVectorHandle vectorhandle, const size_t index); /* CVectorSetCapacity - function to set the CVector capacity */ int CVectorSetCapacity(const CVectorHandle vectorhandle, const size_t capacity); /* CVectorSetElement -- set a copy of an element into a CVector */ int CVectorSetElement(const CVectorHandle vectorhandle, const void CVECTOR_FAR * element, const size_t index); /* CVectorSetFags - function to set the CVector flags */ int CVectorSetFlags(const CVectorHandle vectorhandle, const unsigned int flags); /* CVectorSetSize - function to set the CVector size */ int CVectorSetSize(const CVectorHandle vectorhandle, const size_t size); /* CVectorSize -- macro to return the CVector size */ #define CVectorSize(vectorhandle) (vectorhandle)->size #ifdef __cplusplus } #endif #endif ./CVector-1.0.3.1/CVectorBasicTest.c0000644000076500001200000001570411437457040015513 0ustar yayaadmin/* * CVectorBasicTest.c * CVector * * Created by Herbert J. Bernstein on 12/04/08. * Copyright 2008 Herbert J. Bernstein. All rights reserved. * */ /********************************************************************** * * * YOU MAY REDISTRIBUTE THE CVector API UNDER THE TERMS OF THE LGPL * * * **********************************************************************/ /************************* LGPL NOTICES ******************************* * * * This library 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; either * * version 2.1 of the License, or (at your option) any later version. * * * * This library 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 library; if not, write to the Free * * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, * * MA 02110-1301 USA * * * **********************************************************************/ #ifdef USE_LOCAL_HEADERS #include "CVector.h" #else #include #endif #include typedef long unsigned int LUI; CVectorHandle vectorhandle; int main(int argc, char **argv) { size_t index; double element; double * elementptr; void * velementptr; unsigned int flags; size_t size, capacity; fprintf(stdout," Test 0: Create vector and load it with 1000000 elements.\n"); CVectorCreate(&vectorhandle,sizeof(double),1); for (index=0; index<1000000; index++) { element = (double)index; CVectorAddElement(vectorhandle, &element); if (!(index&0x1FFFF)) { if (CVectorGetCapacity(vectorhandle,&capacity) ){ fprintf(stderr,"Call to CVectorGetCapacity failed.\n"); } if (CVectorGetSize(vectorhandle,&size)) { fprintf(stderr,"Call to CVectorGetSize failed.\n"); } if (size != index+1) { fprintf(stderr,"Size mismatch index+1 %lu, size %lu.\n",(LUI)index+1,(LUI)size); } fprintf(stdout,"Size %lu, capacity %lu.\n", (LUI)size, (LUI)capacity); } } fprintf(stdout," Test 1: Reference elements of CVector as an array.\n"); for (index=0; index<1000000; index++) { if ((double)index != ((double *)(vectorhandle->array))[index]) { fprintf(stderr," data mismatch array[%lu] = %g\n", (LUI)index, ((double *)(vectorhandle->array))[index]); } } fprintf(stdout," Test 2: Reference elements of CVector via CVectorGetElement.\n"); for (index=0; index<(size_t)1000000; index++) { if (CVectorGetElement(vectorhandle, &element, index)) fprintf(stderr," Failed CVectorGetElement, index = %lu\n",(LUI)index); if ((double)index != element) { fprintf(stderr," data mismatch array[%lu] = %g\n", (LUI)index, element); } } /* The next block will referenece the array via pointers This will also set the CVECTOR_FLAGS_NO_RELOCATION Will then reset the flag. */ fprintf(stdout," Test 3: Reference elements of CVector via CVectorGetElementptr.\n"); for (index=0; index<(size_t)1000000; index++) { if (CVectorGetElementptr(vectorhandle, &velementptr, index)) fprintf(stderr," Failed CVectorGetElement, index = %lu\n",(LUI)index); elementptr = (double *)velementptr; if (velementptr != CVectorElementAt(vectorhandle, index)) { fprintf(stderr," Failed CVectorGetElementAt, index = %lu\n",(LUI)index); } if ((double)index != *elementptr) { fprintf(stderr," data mismatch array[%lu] = %g\n", (LUI)index, *elementptr); } } if (CVectorGetFlags(vectorhandle,&flags)) fprintf(stderr,"Call to CVectorGetFlags failed.\n"); if ( !(flags&CVECTOR_FLAGS_NO_RELOCATION) ) fprintf(stderr,"CVECTOR_FLAGS_NO_RELOCATION not set by CVectorGetElementptr.\n"); flags = 0; if (CVectorSetFlags(vectorhandle,flags)) fprintf(stderr,"Call to CVectorSetFlags failed.\n"); fprintf(stdout," Test 4: Set elements of CVector as an array\n"); for (index=0; index<(size_t)1000000; index++) { ((double *)(vectorhandle->array))[index] = (double)(1000000-index); } for (index=0; index<(size_t)1000000; index++) { if ((double)(1000000-index) != ((double *)(vectorhandle->array))[index]) { fprintf(stderr," data mismatch array[%lu] = %g\n", (LUI)index, ((double *)(vectorhandle->array))[index]); } } fprintf(stdout," Test 5: Set elements of CVector via CVectorSetElement.\n"); for (index=0; index<(size_t)1000000; index++) { element = (double)(index-1000000); if (CVectorSetElement(vectorhandle,&element,1000000-index)) fprintf(stderr," Failed CVectorSetElement, index = %lu\n",(LUI)(1000000-index)); } for (index=0; index<(size_t)1000000; index++) { if ((double)(index-1000000) != ((double *)(vectorhandle->array))[1000000-index]) { fprintf(stderr," data mismatch array[%lu] = %g\n", (LUI)index, ((double *)(vectorhandle->array))[1000000-index]); } } fprintf(stdout," Test 6: Remove elements of CVector via CVectorRemoveElement.\n"); for (index=0; index<(size_t)2000; index++) { ((double *)(vectorhandle->array))[index] = (double)(index); } for (index=0; index<(size_t)1000; index++) { if (CVectorRemoveElement(vectorhandle,index)) fprintf(stderr," Failed CVectorRemoveElement, index = %lu\n",(LUI)index); } for (index=0; index<(size_t)1000; index++) { if ((double)(index*2+1) != ((double *)(vectorhandle->array))[index]) { fprintf(stderr," data mismatch array[%lu] = %g\n", (LUI)index, ((double *)(vectorhandle->array))[index]); } } fprintf(stdout," Test 7: Remove all elements of CVector via CVectorClear.\n"); if (CVectorClear(vectorhandle)) fprintf(stderr," Failed CVectorClear\n"); if (CVectorSize(vectorhandle) !=0) { fprintf(stderr," CVectorClear failed to set size to zero\n"); } return 0; } ./CVector-1.0.3.1/CVectorBasicTest_orig.lst0000644000076500001200000000126411437457040017107 0ustar yayaadmin Test 0: Create vector and load it with 1000000 elements. Size 1, capacity 1. Size 131073, capacity 262144. Size 262145, capacity 524288. Size 393217, capacity 524288. Size 524289, capacity 1048576. Size 655361, capacity 1048576. Size 786433, capacity 1048576. Size 917505, capacity 1048576. Test 1: Reference elements of CVector as an array. Test 2: Reference elements of CVector via CVectorGetElement. Test 3: Reference elements of CVector via CVectorGetElementptr. Test 4: Set elements of CVector as an array Test 5: Set elements of CVector via CVectorSetElement. Test 6: Remove elements of CVector via CVectorRemoveElement. Test 7: Remove all elements of CVector via CVectorClear. ./CVector-1.0.3.1/index.html0000755000076500001200000000000011437457040017564 2./README_CVector.htmlustar yayaadmin./CVector-1.0.3.1/lgpl.txt0000644000076500001200000006350011437457040013674 0ustar yayaadmin GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This library 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; either version 2.1 of the License, or (at your option) any later version. This library 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 library; if not, write to the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! ./CVector-1.0.3.1/Makefile0000644000076500001200000001753511437457354013654 0ustar yayaadmin# # Makefile # CVector # # Created by Herbert J. Bernstein on 12/03/08. # Copyright 2008 Herbert J. Bernstein. All rights reserved. # rev 13 Jan 09 -- HJB # rev 1 Sep 10 -- Takanori Matsuura - change -shared to -dynamic # # #********************************************************************** #* * #* YOU MAY REDISTRIBUTE THE CVector API UNDER THE TERMS OF THE LGPL * #* * #**********************************************************************/ #************************* LGPL NOTICES ******************************* #* * #* This library 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; either * #* version 2.1 of the License, or (at your option) any later version. * #* * #* This library 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 library; if not, write to the Free * #* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, * #* MA 02110-1301 USA * #* * #**********************************************************************/ # Version string VERSION = 2:0:0 RELEASE = 1.0.3 # # Compiler and compilation flags # CC = gcc ifneq ($(MSYSTEM),MINGW32) CFLAGS = -g -O2 -Wall -ansi -pedantic else CFLAGS = -g -O2 -Wall endif # # libtool path if system default is not suitable # #LIBTOOL = $(HOME)/bin/libtool ifndef LIBTOOL LIBTOOL = libtool endif # # If local headers must be quoted uncomment the next line # #USE_LOCAL_HEADERS = 1 # # Directories # ROOT = . LIB = $(ROOT)/lib BIN = $(ROOT)/bin SRC = $(ROOT) INC = $(ROOT) EXAMPLES = $(ROOT) TESTDATA = $(ROOT) ifndef INSTALL_PREFIX INSTALL_PREFIX = /usr/local #INSTALL_PREFIX = $(HOME) endif # # Include directories # ifdef USE_LOCAL_HEADERS INCLUDES = -DUSE_LOCAL_HEADERS else INCLUDES = -I$(INC) endif COMPILE_COMMAND = $(LIBTOOL) --mode=compile $(CC) $(CFLAGS) $(INCLUDES) $(WARNINGS) -c LIBRARY_LINK_COMMAND = $(LIBTOOL) --mode=link $(CC) -version-info $(VERSION) -release $(RELEASE) -no-undefined -rpath $(INSTALL_PREFIX)/lib BUILD_COMMAND_LOCAL = $(LIBTOOL) --mode=link $(CC) $(CFLAGS) $(INCLUDES) BUILD_COMMAND_DYNAMIC = $(LIBTOOL) --mode=link $(CC) $(CFLAGS) -dynamic -I $(INSTALL_PREFIX)/include BUILD_COMMAND_STATIC = $(LIBTOOL) --mode=link $(CC) $(CFLAGS) -static -I $(INSTALL_PREFIX)/include INSTALL_COMMAND = $(LIBTOOL) --mode=install cp INSTALL_FINISH_COMMAND = $(LIBTOOL) --mode=finish OBJ_EXT = lo LIB_EXT = la ###################################################################### # You should not need to make modifications below this line # ###################################################################### # # Suffixes of files to be used or built # .SUFFIXES: .c .$(OBJ_EXT) .$(LIB_EXT) # # Common dependencies # COMMONDEP = Makefile # # Source files # SOURCE = $(SRC)/CVector.c # # Header files # HEADERS = $(INC)/CVector.h # Default: instructions # default: @echo ' ' @echo '***************************************************************' @echo ' ' @echo ' PLEASE READ README_CVector.txt and lgpl.txt' @echo ' ' @echo ' Before making the CVector library and example programs, check' @echo ' that the chosen settings are correct' @echo ' ' @echo ' The current compile command is:' @echo ' ' @echo ' $(COMPILE_COMMAND)' @echo ' ' @echo ' The current library link command is:' @echo ' ' @echo ' $(LIBRARY_LINK_COMMAND)' @echo ' ' @echo ' The current library local, dynamic and static build commands are:' @echo ' ' @echo ' $(BUILD_COMMAND_LOCAL)' @echo ' $(BUILD_COMMAND_DYNAMIC)' @echo ' $(BUILD_COMMAND_STATIC)' @echo ' ' @echo ' Before installing the CVector library and example programs, check' @echo ' that the install directory and install commands are correct:' @echo ' ' @echo ' The current values are :' @echo ' ' @echo ' $(INSTALL_PREFIX) ' @echo ' $(INSTALL_COMMAND) ' @echo ' $(INSTALL_FINISH) ' @echo ' ' @echo ' To compile the CVector library and example programs type:' @echo ' ' @echo ' make clean' @echo ' make all' @echo ' ' @echo ' To run a set of tests type:' @echo ' ' @echo ' make tests' @echo ' ' @echo ' To clean up the directories type:' @echo ' ' @echo ' make clean' @echo ' ' @echo ' To install the library and binaries type:' @echo ' ' @echo ' make install' @echo ' ' @echo '***************************************************************' @echo ' ' # # Compile the library and examples # all: $(LIB) $(BIN) $(SOURCE) $(HEADERS) \ $(LIB)/libCVector.$(LIB_EXT) \ $(BIN)/CVectorBasicTest install: all $(INSTALL_PREFIX) $(INSTALL_PREFIX)/lib $(INSTALL_PREFIX)/include \ $(INC) $(LIB)/libCVector.$(LIB_EXT) $(INC)/CVector.h $(INSTALL_COMMAND) $(LIB)/libCVector.$(LIB_EXT) $(INSTALL_PREFIX)/lib/libCVector.$(LIB_EXT) $(INSTALL_FINISH_COMMAND) $(INSTALL_PREFIX)/lib/libCVector.$(LIB_EXT) -cp $(INSTALL_PREFIX)/include/CVector.h $(INSTALL_PREFIX)/include/CVector_old.h cp $(INC)/CVector.h $(INSTALL_PREFIX)/include/CVector.h chmod 644 $(INSTALL_PREFIX)/include/CVector.h echo "Testing final install dynamic" $(BUILD_COMMAND_DYNAMIC) $(EXAMPLES)/CVectorBasicTest.c \ -L$(INSTALL_PREFIX)/lib -lCVector -o $(BIN)/CVectorBasicTest_dynamic $(BIN)/CVectorBasicTest_dynamic > $(TESTDATA)/CVectorBasicTest_dynamic.lst diff -b -c $(TESTDATA)/CVectorBasicTest_orig.lst \ $(TESTDATA)/CVectorBasicTest_dynamic.lst echo "Testing final install static" $(BUILD_COMMAND_STATIC) $(EXAMPLES)/CVectorBasicTest.c \ -L$(INSTALL_PREFIX)/lib -lCVector -o $(BIN)/CVectorBasicTest_static $(BIN)/CVectorBasicTest_static > $(TESTDATA)/CVectorBasicTest_static.lst diff -b -c $(TESTDATA)/CVectorBasicTest_orig.lst \ $(TESTDATA)/CVectorBasicTest_static.lst # # Directories # $(INSTALL_PREFIX): mkdir -p $(INSTALL_PREFIX) $(INSTALL_PREFIX)/lib: $(INSTALL_PREFIX) mkdir -p $(INSTALL_PREFIX)/lib $(INSTALL_PREFIX)/bin: $(INSTALL_PREFIX) mkdir -p $(INSTALL_PREFIX)/bin $(INSTALL_PREFIX)/include: $(INSTALL_PREFIX) mkdir -p $(INSTALL_PREFIX)/include $(LIB): mkdir $(LIB) $(BIN): mkdir $(BIN) # # CVector library # $(LIB)/libCVector.$(LIB_EXT): $(SOURCE) $(HEADERS) $(COMMONDEP) $(COMPILE_COMMAND) -c $(SOURCE) $(LIBRARY_LINK_COMMAND) -o $(LIB)/libCVector.$(LIB_EXT) *.$(OBJ_EXT) # # CVectorBasicTest example program # $(BIN)/CVectorBasicTest: $(LIB)/libCVector.$(LIB_EXT) $(EXAMPLES)/CVectorBasicTest.c $(BUILD_COMMAND_LOCAL) $(EXAMPLES)/CVectorBasicTest.c $(LIB)/libCVector.$(LIB_EXT) \ -o $@ # # Tests # tests: $(LIB) $(BIN) $(BIN)/CVectorBasicTest \ $(TESTDATA)/CVectorBasicTest_orig.lst $(BIN)/CVectorBasicTest > $(TESTDATA)/CVectorBasicTest.lst diff -b -c $(TESTDATA)/CVectorBasicTest_orig.lst \ $(TESTDATA)/CVectorBasicTest.lst # # Remove all non-source files # empty: @-rm -rf $(LIB) @-rm -rf $(BIN) @-rm -f $(TESTDATA)/CVectorBasicTest.lst # # Remove temporary files # clean: @-rm -f core @-rm -f *.o @-rm -f *.$(OBJ_EXT) @-rm -f *.c.* @-rm -rf .libs # # Restore to distribution state # distclean: clean empty ./CVector-1.0.3.1/README_CVector.html0000644000076500001200000003146511437460101015442 0ustar yayaadmin README CVector -- API for Dynamic Arrays SourceForge.net Logo

CVector -- ANSI C API for Dynamic Arrays

Release 1.0.3.1
1 September 2010
© 2008, 2009, 2010 Herbert J. Bernstein

You may distribute the CVector API under the LGPL

CVector is an ANSI C implementation of dynamic arrays to provide a crude approximation to the C++ vector class.

Release 1.0.3.1 is a minor revision to the 1.0.3 release by Takanori Matsuura changing "-shared" to "-dynamic" for Fedora.

The 1.0.3 release was a minor revision of release 1.0.0 of 8 January 2009 to update the Makefile for builds under MINGW, on 26 February 2009 to add the macro CVectorElementAt, and on 7 July 2009 to change the macro to CVECTOR_FAR and similarly change the macros that handle memmove and memset. There are no changes to the code. The internal copy of libtool has been removed.

Installation

The CVector package is available at www.sourceforge.net/projects/cvector. A source tarball is available at downloads.sourceforge.net/cvector/CVector-1.0.3.tar.gz. Later tarballs may be available.

When the source tarball is dowloaded and unpacked, you should have a directory CVector-1.0.3. To see the current settings for a build execute

make

which should give the following information: 


PLEASE READ README_CVector.txt and lgpl.txt
 
 Before making the CVector library and example programs, check
 that the chosen settings are corr
 
 The current compile command is:
 
   libtool --mode=compile gcc -g -O2  -Wall -ansi -pedantic -I.  -c
 
 The current library link command is:
 
   libtool --mode=link  gcc -version-info 1:0:1 -release 1.0.2 -rpath /usr/local/lib
 
 The current library local, dynamic and static build commands are:
 
   libtool --mode=link gcc -g -O2  -Wall -ansi -pedantic -I.
   libtool --mode=link gcc -g -O2  -Wall -ansi -pedantic -shared -I /usr/local/include
   libtool --mode=link gcc -g -O2  -Wall -ansi -pedantic -static -I /usr/local/include
 
 Before installing the CVector library and example programs, check
 that the install directory and install commands are correct:
 
 The current values are :
 
   /usr/local
   libtool --mode=install cp 
    
 
 To compile the CVector library and example programs type:
 
   make clean
   make all
 
 To run a set of tests type:
 
   make tests
 
 To clean up the directories type:
 
   make clean
 
 To install the library and binaries type:
   
   make install

If these settings need to be changed, edit Makefile. On some systems, e.g. Mac OS X, the default libtool is not appropriate. In that case you should install a recent version of libtool. The CVector kit has been tested with libtool versions 1.3.5, 1.5.4 and 2.2.6. If the system libtool is not to be used, define the variable LIBTOOL to be the path to the libtool executable, e.g. in bash. On MINGW, use of gcc 4 and libtool 2.2.6 are highly recommended.

export LIBTOOL=$HOME/bin/libtool

of in the Makefie

LIBTOOL = $(HOME)/bin/libtool

If you need to include local header files using #include "..." instead of #include <...>, define the variable USE_LOCAL_HEADERS

Synopsis

#include <CVector.h>

int
CVectorCreate(CVectorHandle * vectorhandle, const size_t elementsize, const size_t capacity);

int
CVectorAddElement(const CVectorHandle vectorhandle, const void * element);

void *
CVectorElementAt(const CVectorHandle vectorhandle, const size_t index);

int
CVectorGetElement(const CVectorHandle vectorhandle, void * element, const size_t index);

int
CVectorGetElementptr(const CVectorHandle vectorhandle, void ** elementptr, const size_t index);

int
CVectorSetElement(const CVectorHandle vectorhandle, void * element, const size_t index);

int
CVectorRemoveElement(const CVectorHandle vectorhandle, const size_t index);

int
CVectorClear(const CVectorHandle vectorhandle);

int
CVectorFree(CVectorHandle * vectorhandle);

size_t
CVectorCapacity(const CVectorHandle vectorhandle);

int
CVectorGetCapacity(const CVectorHandle vectorhandle, size_t * capacity);

size_t
CVectorSize(const CVectorHandle vectorhandle);

int
CVectorGetSize(const CVectorHandle vectorhandle, size_t * size);

int
CVectorGetFlags(const CVectorHandle vectorhandle, int * flags);

int
CVectorSetCapacity(const CVectorHandle vectorhandle, const size_t capacity);

int
CVectorSetSize(const CVectorHandle vectorhandle, const size_t size);

int
CVectorSetFlags(const CVectorHandle vectorhandle, const unsigned int flags);

Description

The CVector.h header file defines the CVectorHandle type as a dynamic array for elements in which each element uses elementsize characters in a block of memory elementsize*capacity characters long. There are size elements used in the array each with an index between 0 and size-1. CVectorCreate() is used to create the dynamic array. Elements may either be added at the end of the dynamic array using CVectorAddElement(), or in arbitrary order with CVectorSetElement(). Elements may be examined with copy semantics using CVectorGetElement() or as pointers directly into the dynamic array using CVectorGetElementptr(). The function CVectorElementAt() performs the same function as CVectorGetElementptr() for use in complex expressions, but does no error checking. Caution must be used in using pointers because expansion of the dynamic array can force relocation of all data in the dynamic array. Therefore, any use of CVectorGetElementptr() sets a flag, CVECTOR_FLAGS_NO_RELOCATION, that disables any further array relocation, which will prevent the extension of the size array beyond the capacity in effect at the time of the first CVectorGetElementptr() call. Calls to CVectorElementAt() do not set CVECTOR_FLAGS_NO_RELOCATION and returning resulting values to calling routines is dangerous. The functions CVectorGetFlags() and CVectorSetFlags() can be used to reset this flag (see Examples below). The function CVectorRemoveElement() will remove the element of the indicated index, shifting all elements of higher indices down, unless the flag CVECTOR_FLAGS_NO_RELOCATION is set. The capacity, size and flags may be examined or set with CVectorCapacity(), CVectorGetCapacity(), CVectorSize(), CVectorGetSize(), CVectorGetFlags, CVectorSetCapacity(), CVectorSetSize() and CVectorSetFlags().

External declarations as well as the CVector structure definition, and the CVectorHandle definition are included in the <CVector.h> include file. The CVector structure includes at least the following fields:

size_t size;         /* size of the vector */
size_t capacity;         /* capacity of the vector */
size_t elementsize;         /* size of an element */
void * array;         /* the array of elements */
int flags;         /* flags */

The valid flags are CVECTOR_FLAGS_NO_RELOCATION and CVECTOR_FLAGS_NO_RESIZE which may be ORed.

Returns

The functions CVectorCapacity() and CVectorSize() are implemented as macros and return the CVector capacity and size directly. While they could be used as lvalues, such use is not recommended and is not guaranteed to work in future versions of CVector. The function CVectorElementAt() is implemented as a macro and returns a void * pointer into the data array with no bounds checking. All other functions return 0 for normal completion, or the sum of one or more of the following non-zero error codes:

Error Return Numeric Value    Meaning
CVECTOR_MALLOC_FAILED    -1    /* A call to allocate memory failed */
CVECTOR_BAD_ARGUMENT    -2    /* An argument is not valid */
CVECTOR_NOT_FOUND    -4    /* An element could not be found */
CVECTOR_NO_RELOCATION    -8    /* Relocation is not permitted */
CVECTOR_NO_RESIZE    -16    /* A change is size is not permitted */

Examples

To create a vector of doubles, starting with minimal capacity, reporting failure to stderr: 


        #include <CVector.h>
        ...
        CvectorHandle vectorhandle;
        ...
        if (CVectorCreate(&vectorhandle,sizeof(double),1)) fprintf(stderr," CVectorCreate failed!!\n");

To create a vector of arrays of or pointers to doubles: 


        #include <CVector.h>
        ...
        CvectorHandle vectorhandle;
        ...
        if (CVectorCreate(&vectorhandle,sizeof(double *),1)) fprintf(stderr," CVectorCreate failed!!\n");

To pop the last element of a vector of doubles: 


        #include <CVector.h>
        ...
        CvectorHandle vectorhandle;
        double element;
        ...
        if (CVectorGetElement(vectorhandle, &element, (CVectorSize(vectorhandle)-1)) 
            fprintf(stderr," Failed CVectorGetElement);
        if (CVectorRemoveElement(vectorhandle,  (CVectorSize(vectorhandle)-1)) 
            fprintf(stderr," Failed CVectorRemoveElement);

See the test program CVectorBasicTest.c

Updated 7 July 2009
 ./CVector-1.0.3.1/README_CVector.txt0000644000076500001200000002302111437460174015314 0ustar yayaadmin CVector -- ANSI C API for Dynamic Arrays Release 1.0.3.1 1 September 2010 (c) 2008, 2009, 2010 Herbert J. Bernstein yaya at bernstein-plus-sons dot com You may distribute the CVector API under the LGPL CVector is an ANSI C implementation of dynamic arrays to provide a crude approximation to the C++ vector class. Release 1.0.3.1 is a minor revision to the 1.0.3 release by Takanori Matsuura changing "-shared" to "-dynamic" for Fedora. The 1.0.3 release was a minor revision of release 1.0.0 of 8 January 2009 to update the Makefile for builds under MINGW, on 26 February 2009 to add the macro CVectorElementAt, and on 7 July 2009 to change the macro to CVECTOR_FAR and similarly change the macros that handle memmove and memset. There are no changes to the code. The internal copy of libtool has been removed. Installation The CVector package is available at www.sourceforge.net/projects/cvector. A source tarball is available at downloads.sourceforge.net/cvector/CVector-1.0.3.tar.gz. Later tarballs may be available. When the source tarball is dowloaded and unpacked, you should have a directory CVector-1.0.3. To see the current settings for a build execute make which should give the following information: PLEASE READ README_CVector.txt and lgpl.txt Before making the CVector library and example programs, check that the chosen settings are corr The current compile command is: libtool --mode=compile gcc -g -O2 -Wall -ansi -pedantic -I. -c The current library link command is: libtool --mode=link gcc -version-info 1:0:1 -release 1.0.2 -rpath /usr/local/lib The current library local, dynamic and static build commands are: libtool --mode=link gcc -g -O2 -Wall -ansi -pedantic -I. libtool --mode=link gcc -g -O2 -Wall -ansi -pedantic -shared -I /usr/local/include libtool --mode=link gcc -g -O2 -Wall -ansi -pedantic -static -I /usr/local/include Before installing the CVector library and example programs, check that the install directory and install commands are correct: The current values are : /usr/local libtool --mode=install cp To compile the CVector library and example programs type: make clean make all To run a set of tests type: make tests To clean up the directories type: make clean To install the library and binaries type: make install If these settings need to be changed, edit Makefile. On some systems, e.g. Mac OS X, the default libtool is not appropriate. In that case you should install a recent version of libtool. The CVector kit has been tested with libtool versions 1.3.5, 1.5.4 and 2.2.6. If the system libtool is not to be used, define the variable LIBTOOL to be the path to the libtool executable, e.g. in bash. On MINGW, use of gcc 4 and libtool 2.2.6 are highly recommended. export LIBTOOL=$HOME/bin/libtool of in the Makefie LIBTOOL = $(HOME)/bin/libtool If you need to include local header files using #include "..." instead of #include <...>, define the variable USE_LOCAL_HEADERS Synopsis #include int CVectorCreate(CVectorHandle * vectorhandle, const size_t elementsize, const size_t capacity); int CVectorAddElement(const CVectorHandle vectorhandle, const void * element); void * CVectorElementAt(const CVectorHandle vectorhandle, const size_t index); int CVectorGetElement(const CVectorHandle vectorhandle, void * element, const size_t index); int CVectorGetElementptr(const CVectorHandle vectorhandle, void ** elementptr, const size_t index); int CVectorSetElement(const CVectorHandle vectorhandle, void * element, const size_t index); int CVectorRemoveElement(const CVectorHandle vectorhandle, const size_t index); int CVectorClear(const CVectorHandle vectorhandle); int CVectorFree(CVectorHandle * vectorhandle); size_t CVectorCapacity(const CVectorHandle vectorhandle); int CVectorGetCapacity(const CVectorHandle vectorhandle, size_t * capacity); size_t CVectorSize(const CVectorHandle vectorhandle); int CVectorGetSize(const CVectorHandle vectorhandle, size_t * size); int CVectorGetFlags(const CVectorHandle vectorhandle, int * flags); int CVectorSetCapacity(const CVectorHandle vectorhandle, const size_t capacity); int CVectorSetSize(const CVectorHandle vectorhandle, const size_t size); int CVectorSetFlags(const CVectorHandle vectorhandle, const unsigned int flags); Description The CVector.h header file defines the CVectorHandle type as a dynamic array for elements in which each element uses elementsize characters in a block of memory elementsize*capacity characters long. There are size elements used in the array each with an index between 0 and size-1. CVectorCreate() is used to create the dynamic array. Elements may either be added at the end of the dynamic array using CVectorAddElement(), or in arbitrary order with CVectorSetElement(). Elements may be examined with copy semantics using CVectorGetElement() or as pointers directly into the dynamic array using CVectorGetElementptr(). The function CVectorElementAt() performs the same function as CVectorGetElementptr() for use in complex expressions, but does no error checking. Caution must be used in using pointers because expansion of the dynamic array can force relocation of all data in the dynamic array. Therefore, any use of CVectorGetElementptr() sets a flag, CVECTOR_FLAGS_NO_RELOCATION, that disables any further array relocation, which will prevent the extension of the size array beyond the capacity in effect at the time of the first CVectorGetElementptr() call. Calls to CVectorElementAt() do not set CVECTOR_FLAGS_NO_RELOCATION and returning resulting values to calling routines is dangerous. The functions CVectorGetFlags() and CVectorSetFlags() can be used to reset this flag (see Examples below). The function CVectorRemoveElement() will remove the element of the indicated index, shifting all elements of higher indices down, unless the flag CVECTOR_FLAGS_NO_RELOCATION is set. The capacity, size and flags may be examined or set with CVectorCapacity(), CVectorGetCapacity(), CVectorSize(), CVectorGetSize(), CVectorGetFlags, CVectorSetCapacity(), CVectorSetSize() and CVectorSetFlags(). External declarations as well as the CVector structure definition, and the CVectorHandle definition are included in the include file. The CVector structure includes at least the following fields: size_t size; /* size of the vector */ size_t capacity; /* capacity of the vector */ size_t elementsize; /* size of an element */ void * array; /* the array of elements */ int flags; /* flags */ The valid flags are CVECTOR_FLAGS_NO_RELOCATION and CVECTOR_FLAGS_NO_RESIZE which may be ORed. Returns The functions CVectorCapacity() and CVectorSize() are implemented as macros and return the CVector capacity and size directly. While they could be used as lvalues, such use is not recommended and is not guaranteed to work in future versions of CVector. The function CVectorElementAt() is implemented as a macro and returns a void * pointer into the data array with no bounds checking. All other functions return 0 for normal completion, or the sum of one or more of the following non-zero error codes: Error Return Numeric Value Meaning CVECTOR_MALLOC_FAILED -1 /* A call to allocate memory failed */ CVECTOR_BAD_ARGUMENT -2 /* An argument is not valid */ CVECTOR_NOT_FOUND -4 /* An element could not be found */ CVECTOR_NO_RELOCATION -8 /* Relocation is not permitted */ CVECTOR_NO_RESIZE -16 /* A change is size is not permitted */ Examples To create a vector of doubles, starting with minimal capacity, reporting failure to stderr: #include ... CvectorHandle vectorhandle; ... if (CVectorCreate(&vectorhandle,sizeof(double),1)) fprintf(stderr," CVectorCreate failed!!\n"); To create a vector of arrays of or pointers to doubles: #include ... CvectorHandle vectorhandle; ... if (CVectorCreate(&vectorhandle,sizeof(double *),1)) fprintf(stderr," CVectorCreate failed!!\n"); To pop the last element of a vector of doubles: #include ... CvectorHandle vectorhandle; double element; ... if (CVectorGetElement(vectorhandle, &element, (CVectorSize(vectorhandle)-1)) fprintf(stderr," Failed CVectorGetElement); if (CVectorRemoveElement(vectorhandle, (CVectorSize(vectorhandle)-1)) fprintf(stderr," Failed CVectorRemoveElement); See the test program CVectorBasicTest.c ---------------------------------------------------------------------- Updated 7 July 2009 yaya at bernstein-plus-sons dot com