permlib  0.2.6
Library for permutation computations
 All Classes Functions Variables Typedefs Enumerations Friends
include/permlib/change/new_base_change.h
00001 // ---------------------------------------------------------------------------
00002 //
00003 //  This file is part of PermLib.
00004 //
00005 // Copyright (c) 2009-2011 Thomas Rehn <thomas@carmen76.de>
00006 // All rights reserved.
00007 // 
00008 // Redistribution and use in source and binary forms, with or without
00009 // modification, are permitted provided that the following conditions
00010 // are met:
00011 // 1. Redistributions of source code must retain the above copyright
00012 //    notice, this list of conditions and the following disclaimer.
00013 // 2. Redistributions in binary form must reproduce the above copyright
00014 //    notice, this list of conditions and the following disclaimer in the
00015 //    documentation and/or other materials provided with the distribution.
00016 // 3. The name of the author may not be used to endorse or promote products
00017 //    derived from this software without specific prior written permission.
00018 // 
00019 // THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
00020 // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
00021 // OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
00022 // IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
00023 // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
00024 // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
00025 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
00026 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
00027 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
00028 // THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00029 //
00030 // ---------------------------------------------------------------------------
00031 
00032 
00033 #ifndef NEWBASECHANGE_H_
00034 #define NEWBASECHANGE_H_
00035 
00036 #include <permlib/change/base_change.h>
00037 #include <permlib/generator/bsgs_random_generator.h>
00038 #include <permlib/construct/random_schreier_sims_construction.h>
00039 
00040 namespace permlib {
00041 
00043 template<class PERM, class TRANS>
00044 class NewBaseChange : public BaseChange<PERM,TRANS> {
00045 public:
00047         NewBaseChange(const BSGS<PERM,TRANS> &bsgs);
00049         ~NewBaseChange();
00050 
00052         template <class InputIterator>
00053         void change(BSGS<PERM,TRANS> &bsgs, InputIterator baseBegin, InputIterator baseEnd, bool skipRedundant = false) const;
00054 private:
00055         RandomGenerator<PERM>* rng;
00056         RandomSchreierSimsConstruction<PERM,TRANS> rssc;
00057 };
00058 
00059 
00060 template<class PERM, class TRANS>
00061 NewBaseChange<PERM,TRANS>::NewBaseChange(const BSGS<PERM,TRANS> &bsgs) 
00062         : rng(new BSGSRandomGenerator<PERM,TRANS>(bsgs)),
00063       rssc(bsgs.n, rng, bsgs.order())
00064 { }
00065 
00066 template<class PERM, class TRANS>
00067 NewBaseChange<PERM,TRANS>::~NewBaseChange() {
00068         delete rng; 
00069 }
00070 
00071 template<class PERM, class TRANS>
00072 template <class InputIterator>
00073 void NewBaseChange<PERM,TRANS>::change(BSGS<PERM,TRANS> &bsgs, InputIterator baseBegin, InputIterator baseEnd, bool skipRedundant) const {
00074         bool guarantee = false;
00075         bsgs = rssc.construct(bsgs.S.begin(), bsgs.S.end(), baseBegin, baseEnd, guarantee);
00076         BOOST_ASSERT(guarantee);
00077 }
00078 
00079 }
00080 
00081 #endif // -- NEWBASECHANGE_H_