00001 // -*- C++ -*- 00002 /*- 00003 * Copyright (c) 1997 The Regents of the University of California. 00004 * All rights reserved. 00005 * 00006 * Redistribution and use in source and binary forms, with or without 00007 * modification, are permitted provided that the following conditions 00008 * are met: 00009 * 1. Redistributions of source code must retain the above copyright 00010 * notice, this list of conditions and the following disclaimer. 00011 * 2. Redistributions in binary form must reproduce the above copyright 00012 * notice, this list of conditions and the following disclaimer in the 00013 * documentation and/or other materials provided with the distribution. 00014 * 3. All advertising materials mentioning features or use of this software 00015 * must display the following acknowledgement: 00016 * This product includes software developed by the Network Research 00017 * Group at Lawrence Berkeley National Laboratory. 00018 * 4. Neither the name of the University nor of the Laboratory may be used 00019 * to endorse or promote products derived from this software without 00020 * specific prior written permission. 00021 * 00022 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 00023 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00024 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00025 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 00026 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00027 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 00028 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 00029 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00030 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 00031 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 00032 * SUCH DAMAGE. 00033 */ 00034 00035 /* 00036 * RVec is a resizing vector. 00037 * Automatically resize the vector (and zero-fill the unused slots) 00038 * when elements beyond the end are accessed. 00039 * 00040 * RVecs are zero-filled on init. 00041 * Vecs are garbage-filled on init. 00042 */ 00043 00044 #ifndef _intRVec_h 00045 #ifdef __GNUG__ 00046 #pragma interface 00047 #endif 00048 #define _intRVec_h 1 00049 00050 #include "int.Vec.h" 00051 00052 00053 class intRVec : public intVec 00054 { 00055 protected: 00056 void grow(const int n); 00057 public: 00058 intRVec() : intVec() {}; 00059 intRVec(int l) : intVec(l,0) {}; 00060 intRVec(int l, int fill_value) : intVec(l,fill_value) {}; 00061 intRVec(const intVec&v) : intVec(v) {}; 00062 ~intRVec() {}; 00063 00064 int& operator [] (int n); 00065 int viable_range(const int n); 00066 }; 00067 00068 inline int 00069 intRVec::viable_range (const int n) 00070 { 00071 return n >= 0 && n < len; 00072 } 00073 00074 inline int& 00075 intRVec::operator[] (int n) 00076 { 00077 if (n < 0) 00078 range_error(); 00079 if (n >= len) 00080 grow(n + 1); 00081 return s[n]; 00082 } 00083 00084 #endif