permlib  0.2.6
Library for permutation computations
 All Classes Functions Variables Typedefs Enumerations Friends
include/permlib/construct/cyclic_group_construction.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 CYCLIC_GROUP_CONSTRUCTION_H_
00034 #define CYCLIC_GROUP_CONSTRUCTION_H_
00035 
00036 #include <permlib/construct/known_bsgs_construction.h>
00037 
00038 namespace permlib {
00039 
00041 template <class TRANS>
00042 class CyclicGroupConstruction : public KnownBSGSConstruction<typename TRANS::PERMtype, TRANS> {
00043 public:
00045 
00048         CyclicGroupConstruction(unsigned int n);
00049 
00051         BSGS<typename TRANS::PERMtype, TRANS> construct() const;
00052 };
00053 
00054 //
00055 //     ----       IMPLEMENTATION
00056 //
00057 
00058 template <class TRANS>
00059 CyclicGroupConstruction<TRANS>::CyclicGroupConstruction(unsigned int n) 
00060         : KnownBSGSConstruction<typename TRANS::PERMtype, TRANS>(n)
00061 { }
00062 
00063 
00064 template <class TRANS>
00065 BSGS<typename TRANS::PERMtype, TRANS> CyclicGroupConstruction<TRANS>
00066 	::construct() const
00067 {
00068         typedef typename TRANS::PERMtype PERM;
00069         const unsigned int &n = this->m_n;
00070         typename PERM::perm genPerm(n);
00071         for (unsigned int i = 0; i < n; ++i)
00072                 genPerm[i] = (i + 1) % n;
00073         std::list<typename PERM::ptr> cyclicGenerators;
00074         cyclicGenerators.push_back(typename PERM::ptr(new PERM(genPerm)));
00075         const dom_int knownBase[1] = { 0 };
00076         
00077         return KnownBSGSConstruction<PERM, TRANS>::construct(cyclicGenerators.begin(), cyclicGenerators.end(), knownBase, knownBase + 1);
00078 }
00079 
00080 }
00081 
00082 #endif // -- KNOWNBSGSCONSTRUCTION_H_