mirror of
https://github.com/MaSzyna-EU07/maszyna.git
synced 2026-10-17 07:29:20 +02:00
* refactor(sonar): use override instead of redundant virtual (cpp:S3471) * refactor(sonar): remove empty statements, one declaration per statement (cpp:S1116, cpp:S1659) * refactor(sonar): drop redundant lambda return types (cpp:S3574) * refactor(sonar): prefer using over typedef (cpp:S5416) * refactor(sonar): use =default for trivial special members (cpp:S3490) * refactor(sonar): use nullptr literal (cpp:S4962) * refactor(sonar): remove redundant access specifiers (cpp:S3539) * refactor(sonar): remove redundant casts (cpp:S1905) * refactor(sonar): use std::scoped_lock instead of std::lock_guard (cpp:S5997) * refactor(sonar): construct elements in place with emplace_back (cpp:S6003) * refactor(sonar): make narrowing conversions explicit (cpp:S5276) * refactor(sonar): mark unused parameters (cpp:S1172) Unused names are commented out; parameters used only on some platforms are marked [[maybe_unused]]. * refactor(sonar): declare non-mutating member functions const (cpp:S5817) Virtual functions are left untouched so overrides keep matching. * refactor(sonar): merge collapsible nested if statements (cpp:S1066) Comments that preceded the inner if are kept above the merged statement. * refactor(sonar): scope single-use variables in if init-statements (cpp:S6004) * fix(sonar): give polymorphic base classes virtual destructors (cpp:S1235) * refactor(sonar): use try_emplace for map insertion (cpp:S6030) * refactor(sonar): use auto where the type is spelled out on the right (cpp:S5827) * refactor(sonar): remove redundant parentheses (cpp:S1110) * refactor(sonar): document intentionally empty functions (cpp:S1186) * refactor(sonar): remove dead stores (cpp:S1854) Side effects (e.g. LISTLINE++) are kept. * refactor(sonar): remove unused variables, captures and private fields (cpp:S1481, cpp:S1068) * refactor(sonar): use structured bindings for pair access (cpp:S6005) * refactor(sonar): use range-based loops and ranges algorithms (cpp:S5566) * refactor(sonar): split chained assignments (cpp:S1121) * refactor(sonar): add default cases to switch statements (cpp:S3562) * refactor(sonar): use std::size for array lengths (cpp:S7127) * refactor(sonar): use std::ranges algorithms and std::erase(_if) (cpp:S6197) * refactor(sonar): access static members through the class (cpp:S2209) * refactor(sonar): add braces around nested if-else (cpp:S5261) * refactor(sonar): avoid side effects inside typeid operands (cpp:S5279) * refactor(sonar): drop top-level const from by-value return types (cpp:S5951) * refactor(sonar): declare variables separately from their type definitions (cpp:S3646) * refactor(sonar): declare loop counters in the for statement (cpp:S5955) * refactor(sonar): rely on class template argument deduction (cpp:S6012) * refactor(sonar): inherit base constructors instead of forwarding them (cpp:S5952) * refactor(sonar): rename locals that shadow outer declarations (cpp:S1117) Only local variables and definition parameters are renamed; shadowing struct fields and enumerators in headers are left for a separate change. * refactor(sonar): reduce enum qualification with using enum (cpp:S6177) Applied only where no unqualified name in the block could be captured by the introduced enumerators. * refactor(sonar): mark converting constructors explicit (cpp:S1709) sound_source and the gl::object conversion operators stay implicit; they are relied upon by copy-list-initialisation and GL calls. * refactor(sonar): initialise members in initialiser lists or declarations (cpp:S3230) * refactor(sonar): make read-only local references and pointers const (cpp:S5350) * refactor(sonar): take read-only pointer and reference parameters as const (cpp:S995) TTrain command handlers keep their signature, it is fixed by the handler table. * refactor(sonar): pass expensive-to-copy parameters by const reference (cpp:S1238) Signatures declared in files touched by PR 206 (Driver.h, EU07.cpp) and virtual overrides are left unchanged. * refactor(sonar): use transparent comparators for string-keyed maps (cpp:S6045) std::unordered_map instances and map types exposed in headers used by other modules are left as they are. * fix(sonar): do not use UI text as a printf format string (cpp:S5281) Text lines containing '%' would otherwise be interpreted as format specifiers by ImGui::TextColored. * refactor(sonar): use std::bind_front for callbacks (cpp:S5995) * refactor(sonar): drop const_cast on string literals passed to the Python C API (cpp:S859) * refactor(sonar): take read-only string parameters as std::string_view (cpp:S6009) The Windows messaging helpers keep std::string, they need c_str(). * refactor(sonar): make read-only global tables const (cpp:S5421) Mutable global state (flags, timers, singletons) is left as is. * refactor(sonar): replace single-case switch statements with if (cpp:S1301) * refactor(sonar): format UUIDs and log timestamps with std::format (cpp:S6494, cpp:S5945) * refactor(sonar): use std::array for local fixed-size arrays (cpp:S5945) Arrays that are class members or part of headers are left unchanged. * fix(sonar): test the bearing damage bit, not bit 0 (cpp:S872) 'DamageFlag & dtrain_bearing > 0' parsed as 'DamageFlag & (dtrain_bearing > 0)', i.e. DamageFlag & 1, so bearing friction reacted to the wrong damage flag. * refactor(sonar): assorted small fixes - empty() instead of size() comparisons (cpp:S1155) - member initialisers in declaration order (cpp:S3229) - no redundant c_str() when a std::string is accepted (cpp:S7121) - contains() on associative containers (cpp:S6171) - const reference instead of a copying range-for (cpp:S6032) - starts_with() for prefix checks (cpp:S6178) - no std::move on temporaries (cpp:S5274) - has_value() on std::optional (cpp:S7172) - bool literals for bool members (cpp:S5820) - inline only on the definition (cpp:S3548) - explicit base access specifier (cpp:S5965) - explicit element access instead of dereferencing an array (cpp:S7116) - rely on the C++20 rewritten operator!= (cpp:S6186) * refactor(sonar): more small fixes - std::format instead of iostream manipulators in to_string/to_hex_str (cpp:S6495); output verified identical, negative hex values keep the unsigned form - remove an empty compound statement (cpp:S108) - drop an always-false unsigned < 0 branch (cpp:S1768) - explicit lambda capture (cpp:S3608) - std::make_unique (cpp:S5950) * chore: strip stray carriage returns left in TTrain constructor comments * fix: keep quantize() in its own value type The S5276 change cast the result of the generic quantize<Type_>() to unsigned int, which truncated float/double callers (shadow angle slider, editor rotation snapping, AI speed control steps) and broke negative values. * fix(sonar): use integer loop counters in segment sampling (cpp:S2193) * refactor(sonar): clean up issues reported on PR 209 - remove locals left unused after the dead-store cleanup (cpp:S1481, cpp:S1854) - unnamed unused parameter (cpp:S1172) - single-use declarations moved into if init-statements (cpp:S6004) - auto for casted initialisers (cpp:S5827) - const references and pointers where nothing is modified (cpp:S5350) - rename structured bindings shadowed by inner declarations (cpp:S1117)
287 lines
8.7 KiB
C++
287 lines
8.7 KiB
C++
/*
|
|
This Source Code Form is subject to the
|
|
terms of the Mozilla Public License, v.
|
|
2.0. If a copy of the MPL was not
|
|
distributed with this file, You can
|
|
obtain one at
|
|
http://mozilla.org/MPL/2.0/.
|
|
*/
|
|
|
|
/*
|
|
MaSzyna EU07 locomotive simulator
|
|
Copyright (C) 2001-2004 Marcin Wozniak, Maciej Czapkiewicz and others
|
|
|
|
*/
|
|
|
|
#include "stdafx.h"
|
|
#include "world/MemCell.h"
|
|
|
|
#include "simulation/simulation.h"
|
|
#include "vehicle/Driver.h"
|
|
#include "world/Event.h"
|
|
#include "utilities/Logs.h"
|
|
|
|
//---------------------------------------------------------------------------
|
|
|
|
TMemCell::TMemCell( scene::node_data const &Nodedata ) : basic_node( Nodedata ) {}
|
|
|
|
void TMemCell::UpdateValues( std::string_view szNewText, double const fNewValue1, double const fNewValue2, int const CheckMask )
|
|
{
|
|
if (CheckMask & basic_event::flags::mode_add)
|
|
{ // dodawanie wartości
|
|
if( TestFlag( CheckMask, basic_event::flags::text ) )
|
|
szText += szNewText;
|
|
if (TestFlag(CheckMask, basic_event::flags::value1))
|
|
fValue1 += fNewValue1;
|
|
if (TestFlag(CheckMask, basic_event::flags::value2))
|
|
fValue2 += fNewValue2;
|
|
}
|
|
else
|
|
{
|
|
if( TestFlag( CheckMask, basic_event::flags::text ) )
|
|
szText = szNewText;
|
|
if (TestFlag(CheckMask, basic_event::flags::value1))
|
|
fValue1 = fNewValue1;
|
|
if (TestFlag(CheckMask, basic_event::flags::value2))
|
|
fValue2 = fNewValue2;
|
|
}
|
|
if (TestFlag(CheckMask, basic_event::flags::text))
|
|
CommandCheck(); // jeśli zmieniony tekst, próbujemy rozpoznać komendę
|
|
}
|
|
|
|
TCommandType TMemCell::CommandCheck()
|
|
{ // rozpoznanie komendy
|
|
using enum TCommandType;
|
|
if( szText == "SetVelocity" ) // najpopularniejsze
|
|
{
|
|
eCommand = cm_SetVelocity;
|
|
bCommand = false; // ta komenda nie jest wysyłana
|
|
}
|
|
else if( szText == "ShuntVelocity" ) // w tarczach manewrowych
|
|
{
|
|
eCommand = cm_ShuntVelocity;
|
|
bCommand = false; // ta komenda nie jest wysyłana
|
|
}
|
|
else if( szText == "Change_direction" ) // zdarza się
|
|
{
|
|
eCommand = cm_ChangeDirection;
|
|
bCommand = true; // do wysłania
|
|
}
|
|
else if( szText == "OutsideStation" ) // zdarza się
|
|
{
|
|
eCommand = cm_OutsideStation;
|
|
bCommand = false; // tego nie powinno być w komórce
|
|
}
|
|
else if( szText.starts_with("PassengerStopPoint:") ) // porównanie początków
|
|
{
|
|
eCommand = cm_PassengerStopPoint;
|
|
bCommand = false; // tego nie powinno być w komórce
|
|
}
|
|
else if( szText == "SetProximityVelocity" ) // nie powinno tego być
|
|
{
|
|
eCommand = cm_SetProximityVelocity;
|
|
bCommand = false; // ta komenda nie jest wysyłana
|
|
}
|
|
else if( szText == "Emergency_brake" )
|
|
{
|
|
eCommand = cm_EmergencyBrake;
|
|
bCommand = false;
|
|
}
|
|
else if( szText == "CabSignal" ) {
|
|
eCommand = cm_SecuritySystemMagnet;
|
|
bCommand = false;
|
|
}
|
|
else
|
|
{
|
|
eCommand = cm_Unknown; // ciąg nierozpoznany (nie jest komendą)
|
|
bCommand = true; // do wysłania
|
|
}
|
|
return eCommand;
|
|
}
|
|
|
|
bool TMemCell::Load(cParser *parser)
|
|
{
|
|
std::string token;
|
|
parser->getTokens( 6, false );
|
|
*parser
|
|
>> m_area.center.x
|
|
>> m_area.center.y
|
|
>> m_area.center.z
|
|
>> szText
|
|
>> fValue1
|
|
>> fValue2;
|
|
parser->getTokens();
|
|
*parser >> token;
|
|
if (token != "none") // gdy różne od "none"
|
|
asTrackName = token; // sprawdzane przez IsEmpty()
|
|
parser->getTokens();
|
|
*parser >> token;
|
|
if (token != "endmemcell")
|
|
Error("endmemcell statement missing");
|
|
CommandCheck();
|
|
return true;
|
|
}
|
|
|
|
void TMemCell::PutCommand( TController *Mech, glm::dvec3 const *Loc ) const
|
|
{ // wysłanie zawartości komórki do AI
|
|
if (Mech)
|
|
Mech->PutCommand(szText, fValue1, fValue2, Loc);
|
|
}
|
|
|
|
bool TMemCell::Compare( std::string const &szTestText, double const fTestValue1, double const fTestValue2, int const CheckMask,
|
|
comparison_operator const TextOperator, comparison_operator const Value1Operator, comparison_operator const Value2Operator,
|
|
comparison_pass const Pass ) const {
|
|
// porównanie zawartości komórki pamięci z podanymi wartościami
|
|
/*
|
|
if( TestFlag( CheckMask, basic_event::flags::text ) ) {
|
|
// porównać teksty
|
|
auto range = szTestText.find( '*' );
|
|
if( range != std::string::npos ) {
|
|
// compare string parts
|
|
if( 0 != szText.compare( 0, range, szTestText, 0, range ) ) {
|
|
return false;
|
|
}
|
|
}
|
|
else {
|
|
// compare full strings
|
|
if( szText != szTestText ) {
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
// tekst zgodny, porównać resztę
|
|
return ( ( !TestFlag( CheckMask, basic_event::flags::value1 ) || ( fValue1 == fTestValue1 ) )
|
|
&& ( !TestFlag( CheckMask, basic_event::flags::value2 ) || ( fValue2 == fTestValue2 ) ) );
|
|
*/
|
|
bool checkpassed { false };
|
|
bool checkfailed { false };
|
|
|
|
if( TestFlag( CheckMask, basic_event::flags::text ) ) {
|
|
// porównać teksty
|
|
auto wildcardpos = szTestText.find( '*' );
|
|
auto const result { (
|
|
wildcardpos == std::string::npos ?
|
|
compare( szText, szTestText, TextOperator ) :
|
|
compare( szText.substr( 0, wildcardpos ), szTestText.substr( 0, wildcardpos ), TextOperator ) ) };
|
|
checkpassed |= result;
|
|
checkfailed |= !result;
|
|
}
|
|
if( TestFlag( CheckMask, basic_event::flags::value1 ) ) {
|
|
auto const result { compare( fValue1, fTestValue1, Value1Operator ) };
|
|
checkpassed |= result;
|
|
checkfailed |= !result;
|
|
}
|
|
if( TestFlag( CheckMask, basic_event::flags::value2 ) ) {
|
|
auto const result { compare( fValue2, fTestValue2, Value2Operator ) };
|
|
checkpassed |= result;
|
|
checkfailed |= !result;
|
|
}
|
|
|
|
switch( Pass ) {
|
|
using enum comparison_pass;
|
|
case all: { return checkfailed == false; }
|
|
case any: { return checkpassed == true; }
|
|
case none: { return checkpassed == false; }
|
|
default: { return false; }
|
|
}
|
|
};
|
|
|
|
bool TMemCell::IsVelocity() const
|
|
{ // sprawdzenie, czy event odczytu tej komórki ma być do skanowania, czy do kolejkowania
|
|
using enum TCommandType;
|
|
if (eCommand == cm_SetVelocity)
|
|
return true;
|
|
if (eCommand == cm_ShuntVelocity)
|
|
return true;
|
|
return eCommand == cm_SetProximityVelocity;
|
|
};
|
|
|
|
void TMemCell::StopCommandSent()
|
|
{ //
|
|
if (!bCommand)
|
|
return;
|
|
bCommand = false;
|
|
if( OnSent ) {
|
|
// jeśli jest event
|
|
simulation::Events.AddToQuery( OnSent, nullptr );
|
|
}
|
|
};
|
|
|
|
void TMemCell::AssignEvents(basic_event *e)
|
|
{ // powiązanie eventu
|
|
OnSent = e;
|
|
};
|
|
|
|
std::string TMemCell::Values() const {
|
|
|
|
return { "[" + Text() + "] [" + to_string( Value1(), 2 ) + "] [" + to_string( Value2(), 2 ) + "]" };
|
|
}
|
|
|
|
void TMemCell::LogValues() const {
|
|
|
|
WriteLog( "Memcell " + name() + ": " + Values() );
|
|
}
|
|
|
|
// serialize() subclass details, sends content of the subclass to provided stream
|
|
void
|
|
TMemCell::serialize_( std::ostream &Output ) const {
|
|
|
|
// TODO: implement
|
|
}
|
|
// deserialize() subclass details, restores content of the subclass from provided stream
|
|
void
|
|
TMemCell::deserialize_( std::istream &Input ) {
|
|
|
|
// TODO: implement
|
|
}
|
|
|
|
// export() subclass details, sends basic content of the class in legacy (text) format to provided stream
|
|
void
|
|
TMemCell::export_as_text_( std::ostream &Output ) const {
|
|
// header
|
|
Output << "memcell ";
|
|
// location
|
|
Output
|
|
<< location().x << ' '
|
|
<< location().y << ' '
|
|
<< location().z << ' '
|
|
// cell data
|
|
<< szText << ' '
|
|
<< fValue1 << ' '
|
|
<< fValue2 << ' '
|
|
// associated track
|
|
<< ( Track ? Track->name() : asTrackName.empty() ? "none" : asTrackName ) << ' '
|
|
// footer
|
|
<< "endmemcell"
|
|
<< "\n";
|
|
}
|
|
|
|
|
|
|
|
|
|
// legacy method, initializes traction after deserialization from scenario file
|
|
void
|
|
memory_table::InitCells() const {
|
|
|
|
for( auto *cell : m_items ) {
|
|
// Ra: eventy komórek pamięci, wykonywane po wysłaniu komendy do zatrzymanego pojazdu
|
|
cell->AssignEvents( simulation::Events.FindEvent( cell->name() + ":sent" ) );
|
|
// bind specified path with the memory cell
|
|
if( false == cell->asTrackName.empty() ) {
|
|
cell->Track = simulation::Paths.find( cell->asTrackName );
|
|
if( cell->Track == nullptr ) {
|
|
ErrorLog( "Bad memcell: track \"" + cell->asTrackName + "\" referenced in memcell \"" + cell->name() + "\" doesn't exist" );
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// legacy method, sends content of all cells to the log
|
|
void
|
|
memory_table::log_all() const {
|
|
|
|
for( auto const *cell : m_items ) {
|
|
cell->LogValues();
|
|
}
|
|
}
|