client/TestNodeCache.cpp

   1 /*
   2  * This file is part of TouristP2PImpl
   3  *
   4  * Copyright (C) 2007,2008 NUST Institute of Information Technology
   5  * Author: Faisal Khan <faisal.khan at [niit.edu.pk | cern.ch ]>
   6  *
   7  * TouristP2PImpl is free software; you can redistribute it and/or modify
   8  * it under the terms of the GNU General Public License as published by
   9  * the Free Software Foundation; either version 2 of the License, or
  10  * (at your option) any later version.
  11  *
  12  * TouristP2PImpl is distributed in the hope that it will be useful,
  13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15  * GNU General Public License for more details.
  16  *
  17  * You should have received a copy of the GNU General Public License
  18  * along with TouristP2PImpl; if not, write to the Free Software
  19  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  20 */
  21 #include "Tourist/LocalNode.h"
  22 #include "Tourist/Message/RemoteNode.h"
  23 #include "Tourist/AvlCache.h"
  24
  25 using Tourist::LocalNode;
  26 using Tourist::Message::RemoteNode;
  27
  28 int main()
  29 {
  30   //Tourist::NodeSet set;
  31   LocalNode nodeCache;
  32
  33   RemoteNode toSearch;
  34   RemoteNode rn, rn2, rn3;
  35
  36   toSearch  = rn;
  37
  38   nodeCache.addRemote(&rn);
  39   nodeCache.addRemote(&rn2);
  40   nodeCache.addRemote(&rn3);
  41
  42   fprintf(stderr, "Total size of cache %d\n", nodeCache.getNodeCount(0));
  43   Tourist::NodeSet rs;
  44   nodeCache.getNodes(1, rs, PREFIX);
  45
  46   fprintf(stderr, "Total fetched %d\n", rs.treeSize);
  47
  48   Node *result = NULL;
  49   bool status = nodeCache.findId(toSearch, &result);
  50   std::cout<<"status = "<<status<<std::endl;
  51
  52   if (toSearch == rn)
  53     std::cout<<"THey are equal"<<std::endl;
  54
  55
  56
  57   return 0;
  58 }