The open source repository for the action RPG game in development by Sig Productions titled 'Adventures in Lestoria'!
https://forums.lestoria.net
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
134 lines
4.4 KiB
134 lines
4.4 KiB
#pragma region License
|
|
/*
|
|
License (OLC-3)
|
|
~~~~~~~~~~~~~~~
|
|
|
|
Copyright 2024 Joshua Sigona <sigonasr2@gmail.com>
|
|
|
|
Redistribution and use in source and binary forms, with or without modification,
|
|
are permitted provided that the following conditions are met:
|
|
|
|
1. Redistributions or derivations of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
|
|
2. Redistributions or derivative works in binary form must reproduce the above
|
|
copyright notice. This list of conditions and the following disclaimer must be
|
|
reproduced in the documentation and/or other materials provided with the distribution.
|
|
|
|
3. Neither the name of the copyright holder nor the names of its contributors may
|
|
be used to endorse or promote products derived from this software without specific
|
|
prior written permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
|
|
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
|
|
SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
|
|
TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
|
|
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
|
|
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
SUCH DAMAGE.
|
|
|
|
Portions of this software are copyright © 2024 The FreeType
|
|
Project (www.freetype.org). Please see LICENSE_FT.txt for more information.
|
|
All rights reserved.
|
|
*/
|
|
#pragma endregion
|
|
#include "Error.h"
|
|
#include "Tutorial.h"
|
|
|
|
TutorialTaskName Tutorial::currentTaskState=TutorialTaskName::SET_LOADOUT_ITEM;
|
|
std::map<TutorialTaskName,std::unique_ptr<TutorialTask>>Tutorial::taskList;
|
|
|
|
void Tutorial::Initialize(){
|
|
#define CREATETASK(enum,class) taskList[enum]=std::move(std::make_unique<class>());
|
|
CREATETASK(TutorialTaskName::SET_LOADOUT_ITEM,SetLoadoutItemTask);
|
|
CREATETASK(TutorialTaskName::MOVE_AROUND,MoveAroundTask);
|
|
CREATETASK(TutorialTaskName::USE_ATTACK,UseAttackTask);
|
|
CREATETASK(TutorialTaskName::USE_ABILITIES,UseAbilitiesTask);
|
|
CREATETASK(TutorialTaskName::USE_DEFENSIVE,UseDefensiveTask);
|
|
CREATETASK(TutorialTaskName::USE_RECOVERY_ITEMS,UseRecoveryItemsTask);
|
|
CREATETASK(TutorialTaskName::BLACKSMITH,BlacksmithTask);
|
|
CREATETASK(TutorialTaskName::EQUIP_GEAR,EquipGearTask);
|
|
currentTaskState=TutorialTaskName::SET_LOADOUT_ITEM;
|
|
ResetTasks();
|
|
}
|
|
|
|
void Tutorial::SetNextTask(TutorialTaskName task){
|
|
currentTaskState=task;
|
|
if(taskList.count(currentTaskState)){
|
|
taskList[currentTaskState]->OnActivate();
|
|
}
|
|
}
|
|
|
|
void Tutorial::CompleteTask(TutorialTaskName task){
|
|
if(taskList.count(task)){
|
|
taskList[task]->completed=true;
|
|
Tutorial::SetNextTask(TutorialTaskName::NONE);
|
|
taskList[task]->OnComplete();
|
|
}
|
|
}
|
|
|
|
TutorialTask&Tutorial::GetTask(TutorialTaskName task){
|
|
return *taskList.at(task);
|
|
}
|
|
|
|
TutorialTask::TutorialTask(){
|
|
_Initialize();
|
|
}
|
|
|
|
void TutorialTask::Draw()const{}
|
|
|
|
void TutorialTask::_Initialize(){
|
|
completed=false;
|
|
systemInitializeCalled=true;
|
|
Initialize();
|
|
}
|
|
|
|
void TutorialTask::Initialize(){
|
|
if(!systemInitializeCalled)ERR("WARNING! Did not call _Initialize() first! Use TutorialTask::_Initialize() instead!");
|
|
systemInitializeCalled=false;
|
|
}
|
|
|
|
const bool TutorialTask::IsComplete()const{
|
|
return completed;
|
|
}
|
|
|
|
void TutorialTask::Update(){}
|
|
|
|
void TutorialTask::OnActivate(){}
|
|
|
|
void Tutorial::ResetTasks(){
|
|
for(auto&[task,tt]:taskList){
|
|
tt->_Initialize();
|
|
}
|
|
}
|
|
|
|
void Tutorial::Update(){
|
|
if(taskList.count(currentTaskState)){
|
|
TutorialTask*currentTask=taskList[currentTaskState].get();
|
|
if(!currentTask->completed){
|
|
currentTask->Update();
|
|
if(currentTask->CompleteCondition()){
|
|
currentTask->completed=true;
|
|
Tutorial::SetNextTask(TutorialTaskName::NONE);
|
|
currentTask->OnComplete();
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void Tutorial::Draw(){
|
|
if(taskList.count(currentTaskState)){
|
|
taskList[currentTaskState]->Draw();
|
|
}
|
|
}
|
|
|
|
const bool Tutorial::TaskIsComplete(TutorialTaskName task){
|
|
return taskList.at(task)->IsComplete();
|
|
}
|
|
|
|
void Tutorial::GiveUpCurrentTask(){
|
|
SetNextTask(TutorialTaskName::NONE);
|
|
} |