35 lines
1.2 KiB
C++
35 lines
1.2 KiB
C++
// Solutions to the Advent Of Code 2024.
|
|
// Copyright (C) 2024 Stefan Müller
|
|
//
|
|
// This program 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.
|
|
//
|
|
// This program 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
|
|
// this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
#pragma once
|
|
|
|
#include <aoc/MullDataState.h>
|
|
|
|
class MullFactorState
|
|
: public MullDataState
|
|
{
|
|
public:
|
|
MullFactorState(const char expected, const int index);
|
|
void enter(StringStateMachine* stateMachine) override;
|
|
void next(StringStateMachine* stateMachine) override;
|
|
void exit(StringStateMachine* stateMachine) override {};
|
|
void setTransitions(StringState& successState, StringState& failState);
|
|
private:
|
|
char expected_;
|
|
int index_;
|
|
StringState* successState_;
|
|
StringState* failState_;
|
|
};
|