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 using std::max;
  24 using std::min;
  25 using std::cout;
  26 using std::cin;
  27 using std::endl;
  28
  29
  30 static_sequence::static_sequence() {}
  31 static_sequence::~static_sequence() {}
  32 uint static_sequence::length() { return len; }
  33
  34 uint static_sequence::count(uint s) {
  35   return rank(s,len-1);
  36 }
  37
  38 static_sequence * static_sequence::load(FILE * fp) {
  39   uint rd;
  40   if(fread(&rd,sizeof(uint),1,fp)!=1) return NULL;
  41   fseek(fp,-sizeof(uint),SEEK_CUR);
  42   switch(rd) {
  43     case WVTREE_HDR: return static_sequence_wvtree::load(fp);
  44     case GMR_CHUNK_HDR: return static_sequence_gmr_chunk::load(fp);
  45     case GMR_HDR: return static_sequence_gmr::load(fp);
  46     case WVTREE_NOPTRS_HDR: return static_sequence_wvtree_noptrs::load(fp);
  47                 case BS_HDR: return static_sequence_bs::load(fp);
  48   }
  49   return NULL;
  50 }
  51
  52 uint static_sequence::select_next(uint c, uint i) {
  53         return select(c,rank(c,i)+1);
  54 }
  55
  56 bool static_sequence::test(uint * seq, uint n) {
  57         uint sigma = 0;
  58         for(uint i=0;i<n;i++)
  59                 sigma = max(sigma,seq[i]);
  60         uint * occ = new uint[sigma+1];
  61         for(uint i=0;i<=sigma;i++)
  62                 occ[i] = 0;
  63         for(uint i=0;i<n;i++) {
  64                 occ[seq[i]]++;
  65                 if(rank(seq[i],i)!=occ[seq[i]]) {
  66                         cout << "rank failed!" << endl;
  67                         cout << "rank("<<seq[i]<<","<<i<<")="<<rank(seq[i],i)<<endl;
  68                         cout << "expected result: " << occ[seq[i]] << endl;
  69                         delete [] occ;
  70                         return false;
  71                 }
  72                 if(i>0 && rank(seq[i],i-1)!=occ[seq[i]]-1) {
  73                         cout << "rank-1 failed!" << endl;
  74                         delete [] occ;
  75                         return false;
  76                 }
  77                 if(select(seq[i],occ[seq[i]])!=i) {
  78                         cout << "select failed!" << endl;
  79                         cout << "select(" << seq[i] << "," << occ[seq[i]] << ")="<<select(seq[i],occ[seq[i]]) << endl;
  80                         cout << "i=" << i << "  rank(" << seq[i] << ",i)=" << rank(seq[i],i) << endl;
  81                         delete [] occ;
  82                         return false;
  83                 }
  84                 if(access(i)!=seq[i]) {
  85                         cout << "access failed!" << endl;
  86                         delete [] occ;
  87                         return false;
  88                 }
  89         }
  90         delete [] occ;
  91         return true;
  92 }
  93