innermost.hh

00001 // This file is a part of Aurelia.
00002 // Copyright (C) 2010  Valentin David
00003 // Copyright (C) 2010  University of Bergen
00004 //
00005 // This program is free software: you can redistribute it and/or modify
00006 // it under the terms of the GNU General Public License as published by
00007 // the Free Software Foundation, either version 3 of the License, or
00008 // (at your option) any later version.
00009 //
00010 // This program is distributed in the hope that it will be useful,
00011 // but WITHOUT ANY WARRANTY; without even the implied warranty of
00012 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
00013 // GNU General Public License for more details.
00014 //
00015 // You should have received a copy of the GNU General Public License
00016 // along with this program.  If not, see <http://www.gnu.org/licenses/>.
00017 #ifndef __INNERMOST_HH
00018 # define __INNERMOST_HH
00019 
00020 # include "bottomup.hh"
00021 # include "../generic/try.hh"
00022 # include "../strategies.hh"
00023 
00024 namespace aurelia {
00025 
00026   template <typename S>
00027   struct innermost_strategy;
00028 
00029   template <typename S>
00030   innermost_strategy<S> innermost(const S& s);
00031 
00034   template <typename S>
00035   struct innermost_strategy {
00036   private: S s;
00037   public: innermost_strategy(const S& s): s(s) {}
00038     template <typename T>
00039     T operator()(const T& term) const {
00040       return (bottomup(try_(s < innermost(s))))(term);
00041     }
00042   };
00043 
00047   template <typename S>
00048   innermost_strategy<S> innermost(const S& s) {
00049     return innermost_strategy<S>(s);
00050   }
00051 
00052 }
00053 
00054 #endif