X-Git-Url: https://pintos-os.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=src%2Flibpspp%2Fsparse-array.h;h=56360cabc0c47c4f11eb52f17af8fe91b5f088a1;hb=b5c82cc9aabe7e641011130240ae1b2e84348e23;hp=f2e91a603c7f3eb695ea52c39f3a460c6c29b54b;hpb=c97f6581b874c6057dbd4d581552774a3ed56ac5;p=pspp-builds.git diff --git a/src/libpspp/sparse-array.h b/src/libpspp/sparse-array.h index f2e91a60..56360cab 100644 --- a/src/libpspp/sparse-array.h +++ b/src/libpspp/sparse-array.h @@ -1,26 +1,24 @@ -/* PSPP - computes sample statistics. - Copyright (C) 2007 Free Software Foundation, Inc. +/* PSPP - a program for statistical analysis. + Copyright (C) 2007, 2009 Free Software Foundation, Inc. - This program is free software; you can redistribute it and/or - modify it under the terms of the GNU General Public License as - published by the Free Software Foundation; either version 2 of the - License, or (at your option) any later version. + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. - 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 - General Public License for more details. + 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 General Public License for more details. You should have received a copy of the GNU General Public License - along with this program; if not, write to the Free Software - Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA - 02110-1301, USA. */ + along with this program. If not, see . */ /* Sparse array data structure. Implements a dictionary that associates a "unsigned long int" key with fixed-size values (elements). - + The implementation allocates elements in groups of moderate size, so it achieves maximum space efficiency when elements are clustered into groups of consecutive keys. For the same @@ -51,8 +49,13 @@ void *sparse_array_insert (struct sparse_array *, unsigned long int key); void *sparse_array_get (const struct sparse_array *, unsigned long int key); bool sparse_array_remove (struct sparse_array *, unsigned long int key); -void *sparse_array_scan (const struct sparse_array *, - unsigned long int *skip, - unsigned long int *key); +void *sparse_array_first (const struct sparse_array *, + unsigned long int *idxp); +void *sparse_array_next (const struct sparse_array *, + unsigned long int skip, unsigned long int *idxp); +void *sparse_array_last (const struct sparse_array *, + unsigned long int *idxp); +void *sparse_array_prev (const struct sparse_array *, + unsigned long int skip, unsigned long int *idxp); #endif /* libpspp/sparse-array.h */