tutorial/MeritSeqNonCBC.cc

This example shows how to instantiate a sequence of merit values not based on a component-by-component (CBC) sequence of lattice definitions, but using the same algorithms as in the CBC case.

// Copyright (c) 2012 David Munger, Pierre L'Ecuyer, Université de Montréal.
// 
// This file is part of Lattice Builder.
// 
// Lattice Builder is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// 
// Lattice Builder is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
// 
// You should have received a copy of the GNU General Public License
// along with Lattice Builder.  If not, see <http://www.gnu.org/licenses/>.

#include "latbuilder/CoordUniformFigureOfMerit.h"
#include "latcommon/ProductWeights.h"
#include "latbuilder/Kernel/PAlpha.h"
#include "latbuilder/Accumulator.h"
#include "latbuilder/Storage.h"

#include "latbuilder/MeritFilterList.h"
#include "latbuilder/MeritSeq/LatSeqOverCBC.h"
#include "latbuilder/MeritSeq/CoordUniformCBC.h"
#include "latbuilder/MeritSeq/CoordUniformInnerProd.h"
#include "latbuilder/LatSeq/Korobov.h"
#include "latbuilder/GenSeq/CoprimeIntegers.h"
#include "latbuilder/GenSeq/Creator.h"

#include "latbuilder/TextStream.h"

#include <iostream>
#include <limits>

using namespace LatBuilder;
using TextStream::operator<<;

template <typename T, typename... ARGS>
std::unique_ptr<T> unique(ARGS&&... args)
{ return std::unique_ptr<T>(new T(std::forward<ARGS>(args)...)); }

template <LatType L, Compress C>
void test(const Storage<L, C>& storage, Dimension dimension)
{
   auto weights = unique<LatCommon::ProductWeights>();
   weights->setDefaultWeight(0.7);

   CoordUniformFigureOfMerit<Kernel::PAlpha> figure(std::move(weights), 2);
   std::cout << "figure of merit: " << figure << std::endl;

   typedef GenSeq::CoprimeIntegers<decltype(figure)::suggestedCompression()> Coprime;

   auto genSeq  = GenSeq::Creator<Coprime>::create(storage.sizeParam());
   auto genSeq0 = GenSeq::Creator<Coprime>::create(SizeParam<L>(2));

   auto cbc = MeritSeq::cbc<MeritSeq::CoordUniformInnerProd>(storage, figure);

   auto latSeqOverCBC = MeritSeq::latSeqOverCBC(cbc);
   auto latSeq = LatSeq::korobov(storage.sizeParam(), Coprime(storage.sizeParam().numPoints()), dimension);

   MeritFilterList<L> filters;

   auto meritSeq = latSeqOverCBC.meritSeq(latSeq);
   auto filteredSeq = filters.apply(meritSeq);
   auto best = std::min_element(filteredSeq.begin(), filteredSeq.end());
   std::cout << "BEST LATTICE: " << *best.base().base() << " with merit value " << *best << std::endl;
}

int main()
{
   Dimension dim = 3;

   test(Storage<LatType::ORDINARY, Compress::SYMMETRIC>(256), dim);

   return 0;
}