| 1 | //
 | 
|---|
| 2 | // bitarray.cc
 | 
|---|
| 3 | //
 | 
|---|
| 4 | // Modifications are
 | 
|---|
| 5 | // Copyright (C) 1998 Limit Point Systems, Inc.
 | 
|---|
| 6 | //
 | 
|---|
| 7 | // Author: Edward Seidl <seidl@janed.com>
 | 
|---|
| 8 | // Maintainer: LPS
 | 
|---|
| 9 | //
 | 
|---|
| 10 | // This file is part of the SC Toolkit.
 | 
|---|
| 11 | //
 | 
|---|
| 12 | // The SC Toolkit is free software; you can redistribute it and/or modify
 | 
|---|
| 13 | // it under the terms of the GNU Library General Public License as published by
 | 
|---|
| 14 | // the Free Software Foundation; either version 2, or (at your option)
 | 
|---|
| 15 | // any later version.
 | 
|---|
| 16 | //
 | 
|---|
| 17 | // The SC Toolkit is distributed in the hope that it will be useful,
 | 
|---|
| 18 | // but WITHOUT ANY WARRANTY; without even the implied warranty of
 | 
|---|
| 19 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 | 
|---|
| 20 | // GNU Library General Public License for more details.
 | 
|---|
| 21 | //
 | 
|---|
| 22 | // You should have received a copy of the GNU Library General Public License
 | 
|---|
| 23 | // along with the SC Toolkit; see the file COPYING.LIB.  If not, write to
 | 
|---|
| 24 | // the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
 | 
|---|
| 25 | //
 | 
|---|
| 26 | // The U.S. Government is granted a limited license as per AL 91-7.
 | 
|---|
| 27 | //
 | 
|---|
| 28 | 
 | 
|---|
| 29 | /* bitarray.h -- definition of the BitArray Class
 | 
|---|
| 30 |  *
 | 
|---|
| 31 |  *      THIS SOFTWARE FITS THE DESCRIPTION IN THE U.S. COPYRIGHT ACT OF A
 | 
|---|
| 32 |  *      "UNITED STATES GOVERNMENT WORK".  IT WAS WRITTEN AS A PART OF THE
 | 
|---|
| 33 |  *      AUTHOR'S OFFICIAL DUTIES AS A GOVERNMENT EMPLOYEE.  THIS MEANS IT
 | 
|---|
| 34 |  *      CANNOT BE COPYRIGHTED.  THIS SOFTWARE IS FREELY AVAILABLE TO THE
 | 
|---|
| 35 |  *      PUBLIC FOR USE WITHOUT A COPYRIGHT NOTICE, AND THERE ARE NO
 | 
|---|
| 36 |  *      RESTRICTIONS ON ITS USE, NOW OR SUBSEQUENTLY.
 | 
|---|
| 37 |  *
 | 
|---|
| 38 |  *  Author:
 | 
|---|
| 39 |  *      E. T. Seidl
 | 
|---|
| 40 |  *      Bldg. 12A, Rm. 2033
 | 
|---|
| 41 |  *      Computer Systems Laboratory
 | 
|---|
| 42 |  *      Division of Computer Research and Technology
 | 
|---|
| 43 |  *      National Institutes of Health
 | 
|---|
| 44 |  *      Bethesda, Maryland 20892
 | 
|---|
| 45 |  *      Internet: seidl@alw.nih.gov
 | 
|---|
| 46 |  *      July, 1993
 | 
|---|
| 47 |  */
 | 
|---|
| 48 | 
 | 
|---|
| 49 | #include <util/container/bitarray.h>
 | 
|---|
| 50 | #include <util/misc/exenv.h>
 | 
|---|
| 51 | 
 | 
|---|
| 52 | using namespace std;
 | 
|---|
| 53 | 
 | 
|---|
| 54 | using sc::BitArrayLTri;
 | 
|---|
| 55 | 
 | 
|---|
| 56 | BitArrayLTri::BitArrayLTri(int i, int j)
 | 
|---|
| 57 |   : a(0), n(0), nm(0), na(0)
 | 
|---|
| 58 | {
 | 
|---|
| 59 |   if (i!=j) {
 | 
|---|
| 60 |     ExEnv::err0() << indent << "BitArrayLTri(int,int): i != j"
 | 
|---|
| 61 |                  << endl;
 | 
|---|
| 62 |     abort();
 | 
|---|
| 63 |   }
 | 
|---|
| 64 |   int sz = i*(i+1)/2;
 | 
|---|
| 65 | 
 | 
|---|
| 66 |   if(sz) {
 | 
|---|
| 67 |     n = sz/8 + ((sz%8)?1:0);
 | 
|---|
| 68 |     a = new unsigned char[n];
 | 
|---|
| 69 |     memset(a,'\0',n);
 | 
|---|
| 70 |     na=sz; nm=i;
 | 
|---|
| 71 |   }
 | 
|---|
| 72 | }
 | 
|---|
| 73 | 
 | 
|---|
| 74 | BitArrayLTri::~BitArrayLTri()
 | 
|---|
| 75 | {
 | 
|---|
| 76 |   if (a) delete[] a; a=0; n=0;
 | 
|---|
| 77 | }
 | 
|---|
| 78 | 
 | 
|---|
| 79 | // Local Variables:
 | 
|---|
| 80 | // mode: c++
 | 
|---|
| 81 | // c-file-style: "ETS"
 | 
|---|
| 82 | // End:
 | 
|---|