From 41b63eff7f76e6574ef238f821dad0212a619c2a Mon Sep 17 00:00:00 2001 From: Adrian Kummerlaender Date: Sun, 22 Feb 2015 17:14:15 +0100 Subject: Improved `simulate` function of the Turing machine example * introduced `state::state_accessor` helper function and moved position logic into `updatePosition` * added `IsEqual` comparator and expressed other basic comparators in terms of itself --- example/turing/src/machine.h | 92 +++++++++++++++++++++++++------------------- example/turing/src/state.h | 20 +++++++++- src/list/list.h | 8 ++-- src/type.h | 16 +++++--- test.cc | 22 +++++++++++ 5 files changed, 107 insertions(+), 51 deletions(-) diff --git a/example/turing/src/machine.h b/example/turing/src/machine.h index c1338e1..a30c6e3 100644 --- a/example/turing/src/machine.h +++ b/example/turing/src/machine.h @@ -8,21 +8,41 @@ namespace machine { +// (define (updatePosition direction position) +// (cond ((= direction RIGHT) (+ position 1)) +// ((= direction LEFT) (- Position 1)) +// (else position))) +template < + typename Direction, + typename Position +> +using updatePosition = tav::Cond< + tav::Branch< + tav::IsEqualValue>, + tav::Add> + >, + tav::Branch< + tav::IsEqualValue>, + tav::Substract> + >, + tav::Else< + Position + > +>; + + // (define (simulate transition tape state position) // (if (= state FINAL) // tape -// (let* ((current_symbol (readSymbol position tape)) -// (current_state (transition state current_symbol)) -// (direction (nth MOVE current_state)) -// (next_symbol (nth WRITE current_state)) -// (next_state (nth NEXT current_state)) -// (next_position (cond ((= direction RIGHT) (+ position 1)) -// ((= direction LEFT) (- Position 1)) -// (else position)))) +// (let ((current_state (transition state +// (readSymbol position tape)))) // (simulate transition -// (writeSymbol position next_symbol tape) -// next_state, -// next_position))) +// (current_state NEXT) +// (writeSymbol position +// (current_state WRITE) +// tape) +// (updatePosition (current_state MOVE) +// position))))) template < template class Transition, typename State, @@ -30,39 +50,31 @@ template < typename Position > class simulate { - private: - using current_symbol = tape::readSymbol; - using current_state = Transition; - - using direction = tav::Nth; - - using next_symbol = tav::Nth; - using next_state = tav::Nth; - using next_position = tav::Cond< - tav::Branch< - tav::IsEqualValue>, - tav::Add> - >, - tav::Branch< - tav::IsEqualValue>, - tav::Substract> - >, - tav::Else< - Position - > - >; + static_assert( + tav::Not>>::value, + "machine head position out of bounds" + ); - static_assert( - tav::Not>>::value, - "next position out of bounds" - ); + private: + template + using current_state = typename Transition< + State, + tape::readSymbol + >::template get; public: using type = tav::Eval, - next_position + current_state, + tape::writeSymbol< + Position, + current_state, + Tape + >, + updatePosition< + current_state, + Position + > >>; }; @@ -77,8 +89,8 @@ struct simulate { // (define (run program state tape position) // (simulate (transition program) -// tape // state +// tape // position)) template < typename Program, diff --git a/example/turing/src/state.h b/example/turing/src/state.h index f5bd7f2..51fe347 100644 --- a/example/turing/src/state.h +++ b/example/turing/src/state.h @@ -9,12 +9,26 @@ namespace machine { namespace state { -struct field { +namespace field { using ID = tav::Size<0>; using READ = tav::Size<1>; using WRITE = tav::Size<2>; using NEXT = tav::Size<3>; using MOVE = tav::Size<4>; +} + +// (define (state_accessor state) +// (lambda (field) +// (nth field state))) +template +struct state_accessor { + static_assert( + tav::IsPair::value, + "machine state is invalid" + ); + + template + using get = tav::Nth; }; // (define (state_predicate id read) @@ -54,7 +68,9 @@ struct transition { typename State, typename Symbol > - using state = findState; + using state = state_accessor< + findState + >; }; } diff --git a/src/list/list.h b/src/list/list.h index cf4f415..c23362a 100644 --- a/src/list/list.h +++ b/src/list/list.h @@ -18,11 +18,11 @@ using ListOfType = List< std::integral_constant... >; -template -using Head = Car; +template +using Head = Car; -template -using Tail = Cdr; +template +using Tail = Cdr; } diff --git a/src/type.h b/src/type.h index c2ad2d8..2537b70 100644 --- a/src/type.h +++ b/src/type.h @@ -24,10 +24,16 @@ template < typename X, typename Y > -using IsEqualType = Eval>; + +template < + typename X, + typename Y +> +using IsEqualType = IsEqual< typename X::value_type, typename Y::value_type ->>; +>; template < typename X, @@ -36,13 +42,13 @@ template < using IsEqualValue = Boolean; template -using IsTrue = IsEqualValue>; +using IsBoolean = IsEqual; template -using IsBoolean = Eval>; +using IsTrue = IsEqualValue>; template -using IsSize = Eval>; +using IsSize = IsEqual; } diff --git a/test.cc b/test.cc index 774f9be..44c0f6f 100644 --- a/test.cc +++ b/test.cc @@ -30,6 +30,28 @@ int main(int, char **) { } // equality +static_assert( + std::is_same< + tav::Boolean, + tav::IsEqual< + tav::Pair, tav::Int<2>>, + tav::Pair, tav::Int<2>> + > + >::value, + "(IsEqual '(1 . 2) '(1 . 2)) != #t" +); + +static_assert( + std::is_same< + tav::Boolean, + tav::IsEqual< + tav::Pair, tav::Int<2>>, + tav::Pair, tav::Int<3>> + > + >::value, + "(IsEqual '(1 . 2) '(2 . 3)) != #f" +); + static_assert( std::is_same< tav::Boolean, -- cgit v1.2.3