<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>MPQC: bitarray.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css">
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.9 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
</ul>
</div>
<h1>bitarray.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">//</span>
<a name="l00002"></a>00002 <span class="comment">// bitarray.h</span>
<a name="l00003"></a>00003 <span class="comment">//</span>
<a name="l00004"></a>00004 <span class="comment">// Modifications are</span>
<a name="l00005"></a>00005 <span class="comment">// Copyright (C) 1996 Limit Point Systems, Inc.</span>
<a name="l00006"></a>00006 <span class="comment">//</span>
<a name="l00007"></a>00007 <span class="comment">// Author: Edward Seidl <seidl@janed.com></span>
<a name="l00008"></a>00008 <span class="comment">// Maintainer: LPS</span>
<a name="l00009"></a>00009 <span class="comment">//</span>
<a name="l00010"></a>00010 <span class="comment">// This file is part of the SC Toolkit.</span>
<a name="l00011"></a>00011 <span class="comment">//</span>
<a name="l00012"></a>00012 <span class="comment">// The SC Toolkit is free software; you can redistribute it and/or modify</span>
<a name="l00013"></a>00013 <span class="comment">// it under the terms of the GNU Library General Public License as published by</span>
<a name="l00014"></a>00014 <span class="comment">// the Free Software Foundation; either version 2, or (at your option)</span>
<a name="l00015"></a>00015 <span class="comment">// any later version.</span>
<a name="l00016"></a>00016 <span class="comment">//</span>
<a name="l00017"></a>00017 <span class="comment">// The SC Toolkit is distributed in the hope that it will be useful,</span>
<a name="l00018"></a>00018 <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00019"></a>00019 <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00020"></a>00020 <span class="comment">// GNU Library General Public License for more details.</span>
<a name="l00021"></a>00021 <span class="comment">//</span>
<a name="l00022"></a>00022 <span class="comment">// You should have received a copy of the GNU Library General Public License</span>
<a name="l00023"></a>00023 <span class="comment">// along with the SC Toolkit; see the file COPYING.LIB. If not, write to</span>
<a name="l00024"></a>00024 <span class="comment">// the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.</span>
<a name="l00025"></a>00025 <span class="comment">//</span>
<a name="l00026"></a>00026 <span class="comment">// The U.S. Government is granted a limited license as per AL 91-7.</span>
<a name="l00027"></a>00027 <span class="comment">//</span>
<a name="l00028"></a>00028
<a name="l00029"></a>00029 <span class="comment">/* bitarray.h -- definition of the BitArray Class</span>
<a name="l00030"></a>00030 <span class="comment"> *</span>
<a name="l00031"></a>00031 <span class="comment"> * THIS SOFTWARE FITS THE DESCRIPTION IN THE U.S. COPYRIGHT ACT OF A</span>
<a name="l00032"></a>00032 <span class="comment"> * "UNITED STATES GOVERNMENT WORK". IT WAS WRITTEN AS A PART OF THE</span>
<a name="l00033"></a>00033 <span class="comment"> * AUTHOR'S OFFICIAL DUTIES AS A GOVERNMENT EMPLOYEE. THIS MEANS IT</span>
<a name="l00034"></a>00034 <span class="comment"> * CANNOT BE COPYRIGHTED. THIS SOFTWARE IS FREELY AVAILABLE TO THE</span>
<a name="l00035"></a>00035 <span class="comment"> * PUBLIC FOR USE WITHOUT A COPYRIGHT NOTICE, AND THERE ARE NO</span>
<a name="l00036"></a>00036 <span class="comment"> * RESTRICTIONS ON ITS USE, NOW OR SUBSEQUENTLY.</span>
<a name="l00037"></a>00037 <span class="comment"> *</span>
<a name="l00038"></a>00038 <span class="comment"> * Author:</span>
<a name="l00039"></a>00039 <span class="comment"> * E. T. Seidl</span>
<a name="l00040"></a>00040 <span class="comment"> * Bldg. 12A, Rm. 2033</span>
<a name="l00041"></a>00041 <span class="comment"> * Computer Systems Laboratory</span>
<a name="l00042"></a>00042 <span class="comment"> * Division of Computer Research and Technology</span>
<a name="l00043"></a>00043 <span class="comment"> * National Institutes of Health</span>
<a name="l00044"></a>00044 <span class="comment"> * Bethesda, Maryland 20892</span>
<a name="l00045"></a>00045 <span class="comment"> * Internet: seidl@alw.nih.gov</span>
<a name="l00046"></a>00046 <span class="comment"> * July, 1993</span>
<a name="l00047"></a>00047 <span class="comment"> */</span>
<a name="l00048"></a>00048
<a name="l00049"></a>00049 <span class="preprocessor">#ifndef _util_container_bitarray_h</span>
<a name="l00050"></a>00050 <span class="preprocessor"></span><span class="preprocessor">#define _util_container_bitarray_h</span>
<a name="l00051"></a>00051 <span class="preprocessor"></span>
<a name="l00052"></a>00052 <span class="preprocessor">#include <string.h></span>
<a name="l00053"></a>00053 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00054"></a>00054
<a name="l00055"></a>00055 <span class="preprocessor">#include <util/misc/formio.h></span>
<a name="l00056"></a>00056
<a name="l00057"></a>00057 <span class="keyword">namespace </span>sc {
<a name="l00058"></a>00058
<a name="l00059"></a>00059 <span class="comment">//</span>
<a name="l00060"></a>00060 <span class="comment">// class BitArrayLTri is used as the lower triangle of a boolean matrix.</span>
<a name="l00061"></a>00061 <span class="comment">// rather than storing an int or a char, just use one bit for each, so</span>
<a name="l00062"></a>00062 <span class="comment">// instead of n(n+1)/2 bytes of storage you have n(n+1)/16 bytes. A</span>
<a name="l00063"></a>00063 <span class="comment">// further savings of n bits could be obtained by setting the diagonal to</span>
<a name="l00064"></a>00064 <span class="comment">// always true or always false depending on the application, but this would</span>
<a name="l00065"></a>00065 <span class="comment">// probably be more expensive computationally than it's worth.</span>
<a name="l00066"></a>00066 <span class="comment">//</span>
<a name="l00067"></a>00067
<a name="l00068"></a>00068 <span class="keyword">class </span>BitArrayLTri {
<a name="l00069"></a>00069 <span class="keyword">private</span>:
<a name="l00070"></a>00070 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *a;
<a name="l00071"></a>00071 <span class="keywordtype">int</span> n;
<a name="l00072"></a>00072 <span class="keywordtype">int</span> nm;
<a name="l00073"></a>00073 <span class="keywordtype">int</span> na;
<a name="l00074"></a>00074
<a name="l00075"></a>00075 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l00076"></a>00076 ij_offset(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j)
<a name="l00077"></a>00077 {
<a name="l00078"></a>00078 <span class="keywordflow">return</span> (i>j) ? (((i*(i+1)) >> 1) + j) : (((j*(j+1)) >> 1) + i);
<a name="l00079"></a>00079 }
<a name="l00080"></a>00080
<a name="l00081"></a>00081 <span class="keyword">public</span>:
<a name="l00082"></a>00082 BitArrayLTri(<span class="keywordtype">int</span> =0, <span class="keywordtype">int</span> =0);
<a name="l00083"></a>00083 ~BitArrayLTri();
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <span class="keywordtype">void</span> <span class="keyword">set</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i) { a[(i>>3)] |= (1 << (i&7)); }
<a name="l00086"></a>00086 <span class="keywordtype">void</span> <span class="keyword">set</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j) { <span class="keyword">set</span>(ij_offset(i,j)); }
<a name="l00087"></a>00087
<a name="l00088"></a>00088 <span class="keywordtype">int</span> is_set(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j)<span class="keyword"> const</span>
<a name="l00089"></a>00089 <span class="keyword"> </span>{ <span class="keywordtype">int</span> ij = ij_offset(i,j); <span class="keywordflow">return</span> (a[(ij>>3)] & (1 << (ij&7))); }
<a name="l00090"></a>00090 <span class="keywordtype">int</span> is_set(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)<span class="keyword"> const</span>
<a name="l00091"></a>00091 <span class="keyword"> </span>{ <span class="keywordflow">return</span> (a[(i>>3)] & (1 << (i&7))); }
<a name="l00092"></a>00092
<a name="l00093"></a>00093 <span class="keywordtype">int</span> operator()(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j)<span class="keyword"> const</span>
<a name="l00094"></a>00094 <span class="keyword"> </span>{ <span class="keywordtype">int</span> ij = ij_offset(i,j); <span class="keywordflow">return</span> (a[(ij>>3)] & (1 << (ij&7))); }
<a name="l00095"></a>00095 <span class="keywordtype">int</span> operator()(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)<span class="keyword"> const</span>
<a name="l00096"></a>00096 <span class="keyword"> </span>{ <span class="keywordflow">return</span> (a[(i>>3)] & (1 << (i&7))); }
<a name="l00097"></a>00097 <span class="keywordtype">int</span> operator[](<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)<span class="keyword"> const</span>
<a name="l00098"></a>00098 <span class="keyword"> </span>{ <span class="keywordflow">return</span> (a[(i>>3)] & (1 << (i&7))); }
<a name="l00099"></a>00099
<a name="l00100"></a>00100 <span class="keywordtype">int</span> dim()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> na; }
<a name="l00101"></a>00101 <span class="keywordtype">int</span> nrow()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> nm; }
<a name="l00102"></a>00102 <span class="keywordtype">int</span> ncol()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> nm; }
<a name="l00103"></a>00103
<a name="l00104"></a>00104 <span class="keywordtype">int</span> degree(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)<span class="keyword"> const </span>{
<a name="l00105"></a>00105 <span class="keywordtype">int</span> nedge=0;
<a name="l00106"></a>00106 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j=0; j < nm; j++) <span class="keywordflow">if</span> ((*<span class="keyword">this</span>)(i,j)) nedge++;
<a name="l00107"></a>00107 <span class="keywordflow">return</span> nedge;
<a name="l00108"></a>00108 }
<a name="l00109"></a>00109 };
<a name="l00110"></a>00110
<a name="l00111"></a>00111 }
<a name="l00112"></a>00112
<a name="l00113"></a>00113 <span class="preprocessor">#endif</span>
<a name="l00114"></a>00114 <span class="preprocessor"></span>
<a name="l00115"></a>00115 <span class="comment">// Local Variables:</span>
<a name="l00116"></a>00116 <span class="comment">// mode: c++</span>
<a name="l00117"></a>00117 <span class="comment">// c-file-style: "ETS"</span>
<a name="l00118"></a>00118 <span class="comment">// End:</span>
</pre></div></div>
<hr>
<address>
<small>
Generated at Wed Oct 14 14:12:09 2009 for <a
href="http://www.mpqc.org">MPQC</a>
2.3.1 using the documentation package <a
href="http://www.doxygen.org">Doxygen</a>
1.5.9.
</small>
</address>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
247b28499c443e092731ffba814075f2
>
files
>
38
