libcds/src/static_sequence/static_sequence.cpp

   1 /* static_sequence.cpp
   2  * Copyright (C) 2008, Francisco Claude, all rights reserved.
   3  *
   4  * static_sequence definition
   5  *
   6  * This library is free software; you can redistribute it and/or
   7  * modify it under the terms of the GNU Lesser General Public
   8  * License as published by the Free Software Foundation; either
   9  * version 2.1 of the License, or (at your option) any later version.
  10  *
  11  * This library is distributed in the hope that it will be useful,
  12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14  * Lesser General Public License for more details.
  15  *
  16  * You should have received a copy of the GNU Lesser General Public
  17  * License along with this library; if not, write to the Free Software
  18  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
  19  *
  20  */
  21
  22 #include <static_sequence.h>
  23
  24 static_sequence::static_sequence() {}
  25 static_sequence::~static_sequence() {}
  26 uint static_sequence::length() { return len; }
  27
  28 uint static_sequence::count(uint s) {
  29   return rank(s,len-1);
  30 }
  31
  32 static_sequence * static_sequence::load(FILE * fp) {
  33   uint rd;
  34   if(fread(&rd,sizeof(uint),1,fp)!=1) return NULL;
  35   fseek(fp,-sizeof(uint),SEEK_CUR);
  36   switch(rd) {
  37     case WVTREE_HDR: return static_sequence_wvtree::load(fp);
  38     case GMR_CHUNK_HDR: return static_sequence_gmr_chunk::load(fp);
  39     case GMR_HDR: return static_sequence_gmr::load(fp);
  40     case WVTREE_NOPTRS_HDR: return static_sequence_wvtree_noptrs::load(fp);
  41                 case BS_HDR: return static_sequence_bs::load(fp);
  42   }
  43   return NULL;
  44 }
  45
  46 uint static_sequence::select_next(uint c, uint i) {
  47         return select(c,rank(c,i)+1);
  48 }
  49
  50 bool static_sequence::test(uint * seq, uint n) {
  51         uint sigma = 0;
  52         for(uint i=0;i<n;i++)
  53                 sigma = max(sigma,seq[i]);
  54         uint * occ = new uint[sigma+1];
  55         for(uint i=0;i<=sigma;i++)
  56                 occ[i] = 0;
  57         for(uint i=0;i<n;i++) {
  58                 occ[seq[i]]++;
  59                 if(rank(seq[i],i)!=occ[seq[i]]) {
  60                         cout << "rank failed!" << endl;
  61                         cout << "rank("<<seq[i]<<","<<i<<")="<<rank(seq[i],i)<<endl;
  62                         cout << "expected result: " << occ[seq[i]] << endl;
  63                         delete [] occ;
  64                         return false;
  65                 }
  66                 if(i>0 && rank(seq[i],i-1)!=occ[seq[i]]-1) {
  67                         cout << "rank-1 failed!" << endl;
  68                         delete [] occ;
  69                         return false;
  70                 }
  71                 if(select(seq[i],occ[seq[i]])!=i) {
  72                         cout << "select failed!" << endl;
  73                         cout << "select(" << seq[i] << "," << occ[seq[i]] << ")="<<select(seq[i],occ[seq[i]]) << endl;
  74                         cout << "i=" << i << "  rank(" << seq[i] << ",i)=" << rank(seq[i],i) << endl;
  75                         delete [] occ;
  76                         return false;
  77                 }
  78                 if(access(i)!=seq[i]) {
  79                         cout << "access failed!" << endl;
  80                         delete [] occ;
  81                         return false;
  82                 }
  83         }
  84         delete [] occ;
  85         return true;
  86 }
  87