// // ipv2_karray.cc // // Copyright (C) 1996 Limit Point Systems, Inc. // // Author: Curtis Janssen // Maintainer: LPS // // This file is part of the SC Toolkit. // // The SC Toolkit is free software; you can redistribute it and/or modify // it under the terms of the GNU Library General Public License as published by // the Free Software Foundation; either version 2, or (at your option) // any later version. // // The SC Toolkit 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 Library General Public License for more details. // // You should have received a copy of the GNU Library General Public License // along with the SC Toolkit; see the file COPYING.LIB. If not, write to // the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. // // The U.S. Government is granted a limited license as per AL 91-7. // /* These routines manipulate keyword arrays. A keyword * array differs from a data array in that its indices are indicated * by a keyword segment. For example: array:0:1 = 6 is a keyword * array element. The count is the upper bound plus 1. */ /* NOTE: If these routines are used to access keyword arrays, then * only the first place in the cwk in which a keyword array name is * found will be used. */ #include #include #include #include #include using namespace sc; void IPV2::ip_cwk_karray_add_v(int n,int*v) { int i; char indices[110],index[10]; if (n>10) { warn("ip_cwk_karray_add_v: too many indices"); return; } indices[0] = '\0'; for (i=0; i 999999999 || v[i] < 0) { warn("ip_cwk_karray_add_v: an index is too large or small"); return; } sprintf(index,"%d",v[i]); strcpy(indices,index); if (i!=n-1) strcpy(indices,":"); } cwk_add(indices); return; } void IPV2::ip_cwk_karray_add(int n,...) { va_list args; int i; int *v; if (n==0) { ip_cwk_karray_add_v(n,NULL); return; } else { v = (int *) malloc(sizeof(int)*n); if (!v) { warn("ip_cwk_karray_add: problem with malloc"); return; } va_start(args, n); for (i=0; idown; if (!r) return NULL; for (i=0; i 999999999 || v[i] < 0) { warn("ip_karray_descend_v: an index is too large or small"); return NULL; } sprintf(index,"%d",v[i]); r = ip_descend_tree(r,index); if (r) r=r->down; } return r; } ip_keyword_tree_t* IPV2::ip_karray_descend(ip_keyword_tree_t*kt,int n,...) { va_list args; int i; int *v; if (n==0) { return ip_karray_descend_v(kt,n,NULL); } else { v = (int *) malloc(sizeof(int)*n); if (!v) { warn("ip_karray_descend: problem with malloc"); return NULL; } va_start(args, n); for (i=0; ikeyword,"%d",&index) != 1) return OutOfBounds; if (index<0) return OutOfBounds; if (index+1 > max) max = index + 1; } while ((I = I->across) != kt); *karray_count = max; return OK; } /* This counts the number of elements in a keyword array. */ IPV2::Status IPV2::count(const char *keyword,int *karray_count,int n,...) { va_list args; int i; int *v; Status r; if (n==0) { return count_v(keyword,karray_count,n,NULL); } else { v = (int *) malloc(sizeof(int)*n); if (!v) return Malloc; va_start(args, n); for (i=0; i