00001 // 00002 // Copyright (C) 2006 Institut fuer Telematik, Universitaet Karlsruhe (TH) 00003 // 00004 // This program is free software; you can redistribute it and/or 00005 // modify it under the terms of the GNU General Public License 00006 // as published by the Free Software Foundation; either version 2 00007 // of the License, or (at your option) any later version. 00008 // 00009 // This program is distributed in the hope that it will be useful, 00010 // but WITHOUT ANY WARRANTY; without even the implied warranty of 00011 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00012 // GNU General Public License for more details. 00013 // 00014 // You should have received a copy of the GNU General Public License 00015 // along with this program; if not, write to the Free Software 00016 // Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. 00017 // 00018 00024 #ifndef __ITERATIVE_LOOKUP_CONFIGURATION_H 00025 #define __ITERATIVE_LOOKUP_CONFIGURATION_H 00026 00032 class IterativeLookupConfiguration 00033 { 00034 public: 00035 int redundantNodes; 00036 int parallelPaths; 00037 int parallelRpcs; 00038 bool strictParallelRpcs; 00039 bool useAllParallelResponses; 00040 bool newRpcOnEveryTimeout; 00041 bool newRpcOnEveryResponse; 00042 bool finishOnFirstUnchanged; 00043 bool verifySiblings; 00044 bool majoritySiblings; 00045 bool merge; 00046 bool failedNodeRpcs; 00047 bool visitOnlyOnce; 00048 bool acceptLateSiblings; 00049 }; 00050 00051 #endif