permlib  0.2.6
Library for permutation computations
 All Classes Functions Variables Typedefs Enumerations Friends
include/permlib/symmetric_group.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 SYMMETRICGROUP_H_
00034 #define SYMMETRICGROUP_H_
00035 
00036 #include <permlib/bsgs_core.h>
00037 #include <permlib/transversal/symmetric_group_transversal.h>
00038 
00039 #include <boost/shared_ptr.hpp>
00040 
00041 namespace permlib {
00042 
00044 
00051 template<class PERM>
00052 struct SymmetricGroup : public BSGSCore<PERM, SymmetricGroupTransversal<PERM> > {
00054         explicit SymmetricGroup(unsigned int n);
00056         SymmetricGroup(const SymmetricGroup<PERM>& symGroup);
00058         SymmetricGroup& operator=(const SymmetricGroup<PERM>& symGroup);
00059         
00061         typedef SymmetricGroupTransversal<PERM> TRANS;
00062         
00063         virtual bool isSymmetricGroup() const { return true; }
00064 private:
00065         void copy(const SymmetricGroup<PERM>& symGroup);
00066 };
00067 
00068 template<class PERM>
00069 inline SymmetricGroup<PERM>::SymmetricGroup(unsigned int n_)
00070         : BSGSCore<PERM,TRANS>(-n_, n_, n_)
00071 {
00072         BOOST_ASSERT(this->n > 0);
00073         BSGSCore<PERM,TRANS>::U.reserve(this->n);
00074         for (unsigned int i = 0; i < this->n; ++i) {
00075                 BSGSCore<PERM,TRANS>::B[i] = this->n-1-i;
00076                 BSGSCore<PERM,TRANS>::U.push_back(SymmetricGroupTransversal<PERM>(this, i));
00077                 if (i < static_cast<unsigned int>(this->n-1)) {
00078                         boost::shared_ptr<PERM> gen(new PERM(this->n));
00079                         gen->setTransposition(i, i+1);
00080                         BSGSCore<PERM,TRANS>::S.push_back(gen);
00081                 }
00082         }
00083 }
00084 
00085 template<class PERM>
00086 inline void SymmetricGroup<PERM>::copy(const SymmetricGroup<PERM>& symGroup) 
00087 {
00088         const unsigned long& n2 = symGroup.n;
00089         BSGSCore<PERM,TRANS>::U.reserve(n2);
00090         for (unsigned int i = 0; i < n2; ++i) {
00091                 BSGSCore<PERM,TRANS>::B[i] = symGroup.B[i];
00092                 BSGSCore<PERM,TRANS>::U.push_back(SymmetricGroupTransversal<PERM>(this, i));
00093                 if (i < n2-1) {
00094                         boost::shared_ptr<PERM> gen(new PERM(n2));
00095                         gen->setTransposition(i, i+1);
00096                         BSGSCore<PERM,TRANS>::S.push_back(gen);
00097                 }
00098         }
00099 }
00100 
00101 template<class PERM>
00102 inline SymmetricGroup<PERM>::SymmetricGroup(const SymmetricGroup<PERM>& symGroup) 
00103         : BSGSCore<PERM,TRANS>(-symGroup.n, symGroup.n, symGroup.n)
00104 {
00105         copy(symGroup);
00106 }
00107 
00108 template<class PERM>
00109 inline SymmetricGroup<PERM>& SymmetricGroup<PERM>::operator=(const SymmetricGroup<PERM>& symGroup) 
00110 {
00111         BOOST_ASSERT(symGroup.n == this->n);
00112         
00113         BSGSCore<PERM,TRANS>::n = symGroup.n;
00114         BSGSCore<PERM,TRANS>::m_id = symGroup.m_id;
00115         copy(symGroup);
00116         return *this;
00117 }
00118 
00119 }
00120 
00121 
00122 #endif // SYMMETRICGROUP_H_