mirror of
https://codeberg.org/vyn/mirai.git
synced 2025-07-05 03:03:20 +00:00
Switch from Qt6 to Slint
This commit is contained in:
parent
f8be14bcf8
commit
63bf267a22
107 changed files with 27532 additions and 2896 deletions
65
lib/cpp-utils/debug.h
Normal file
65
lib/cpp-utils/debug.h
Normal file
|
@ -0,0 +1,65 @@
|
|||
/*
|
||||
* Mirai. Copyright (C) 2024 Vyn
|
||||
* This file is licensed under version 3 of the GNU General Public License (GPL-3.0-only)
|
||||
* The license can be found in the LICENSE file or at https://www.gnu.org/licenses/gpl-3.0.txt
|
||||
*/
|
||||
|
||||
#ifndef CPP_UTILS_DEBUG_H
|
||||
#define CPP_UTILS_DEBUG_H
|
||||
|
||||
#include <algorithm>
|
||||
#include <chrono>
|
||||
#include <iostream>
|
||||
#include <ostream>
|
||||
#include <string>
|
||||
|
||||
namespace cpputils::debug
|
||||
{
|
||||
|
||||
class Timer
|
||||
{
|
||||
public:
|
||||
Timer() : startTime(std::chrono::steady_clock::now())
|
||||
{
|
||||
}
|
||||
|
||||
void start()
|
||||
{
|
||||
startTime = std::chrono::steady_clock::now();
|
||||
isRunning = true;
|
||||
}
|
||||
|
||||
void stop()
|
||||
{
|
||||
const auto now = std::chrono::steady_clock::now();
|
||||
duration += std::chrono::duration_cast<std::chrono::milliseconds>(now - startTime).count();
|
||||
isRunning = false;
|
||||
}
|
||||
|
||||
void reset()
|
||||
{
|
||||
duration = 0;
|
||||
isRunning = false;
|
||||
}
|
||||
|
||||
void printTimeElapsed(const std::string &message) const
|
||||
{
|
||||
long durationToShow = duration;
|
||||
if (isRunning) {
|
||||
const auto now = std::chrono::steady_clock::now();
|
||||
durationToShow +=
|
||||
std::chrono::duration_cast<std::chrono::milliseconds>(now - startTime).count();
|
||||
}
|
||||
std::cout << "[Debug - Timer] " << message << ": " << durationToShow << " ms" << std::endl;
|
||||
}
|
||||
|
||||
private:
|
||||
std::chrono::time_point<std::chrono::steady_clock, std::chrono::nanoseconds> startTime;
|
||||
|
||||
// Timer are always running when created. You can use .reset() after creation.
|
||||
bool isRunning = true;
|
||||
long duration = 0;
|
||||
};
|
||||
} // namespace cpputils::debug
|
||||
|
||||
#endif
|
27
lib/cpp-utils/string.h
Normal file
27
lib/cpp-utils/string.h
Normal file
|
@ -0,0 +1,27 @@
|
|||
/*
|
||||
* Mirai. Copyright (C) 2024 Vyn
|
||||
* This file is licensed under version 3 of the GNU General Public License (GPL-3.0-only)
|
||||
* The license can be found in the LICENSE file or at https://www.gnu.org/licenses/gpl-3.0.txt
|
||||
*/
|
||||
|
||||
#ifndef CPP_UTILS_STRING_H
|
||||
#define CPP_UTILS_STRING_H
|
||||
|
||||
#include <algorithm>
|
||||
#include <string>
|
||||
|
||||
namespace cpputils::string {
|
||||
|
||||
inline std::string trim(std::string str) {
|
||||
str.erase(str.begin(), std::ranges::find_if(str, [](unsigned char ch) {
|
||||
return !std::isspace(ch);
|
||||
}));
|
||||
str.erase(std::ranges::find_if(str.rbegin(), str.rend(), [](unsigned char ch) {
|
||||
return !std::isspace(ch);
|
||||
}).base(), str.end());
|
||||
return str;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
#endif
|
48
lib/cpp-utils/vector.h
Normal file
48
lib/cpp-utils/vector.h
Normal file
|
@ -0,0 +1,48 @@
|
|||
/*
|
||||
* Mirai. Copyright (C) 2024 Vyn
|
||||
* This file is licensed under version 3 of the GNU General Public License (GPL-3.0-only)
|
||||
* The license can be found in the LICENSE file or at https://www.gnu.org/licenses/gpl-3.0.txt
|
||||
*/
|
||||
|
||||
#ifndef CPP_UTILS_VECTOR_H
|
||||
#define CPP_UTILS_VECTOR_H
|
||||
|
||||
#include <algorithm>
|
||||
#include <vector>
|
||||
|
||||
namespace cpputils::vector
|
||||
{
|
||||
|
||||
template <typename C, typename T>
|
||||
concept AnyIterable = std::same_as<typename C::value_type, T> && requires(C c) {
|
||||
{
|
||||
c.begin()
|
||||
} -> std::forward_iterator;
|
||||
{
|
||||
c.end()
|
||||
} -> std::forward_iterator;
|
||||
{
|
||||
const_cast<const C &>(c).begin()
|
||||
} -> std::forward_iterator;
|
||||
{
|
||||
const_cast<const C &>(c).end()
|
||||
} -> std::forward_iterator;
|
||||
};
|
||||
|
||||
template <typename T> bool contains(const std::vector<T> &vec, const T &value)
|
||||
{
|
||||
return std::ranges::find(vec, value) != vec.end();
|
||||
}
|
||||
|
||||
template <typename T> bool containsAll(const std::vector<T> &vec, const AnyIterable<T> auto vec2)
|
||||
{
|
||||
for (auto &elem : vec) {
|
||||
if (!contains(vec2, elem)) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
} // namespace cpputils::vector
|
||||
|
||||
#endif
|
Loading…
Add table
Add a link
Reference in a new issue