ado/ssp
1
1
Fork 0
mirror of https://github.com/red0124/ssp.git synced 2025-01-23 13:05:20 +01:00
Code Issues Packages Projects Releases Wiki Activity

[skip ci] Update coverage.yml

Browse Source
This commit is contained in:
ado 2024-02-21 01:25:53 +01:00
parent 9d96a7d47f
commit 59f6591da3
3 changed files with 22 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
.github/workflows/coverage.yml vendored
View File

@ -60,7 +60,7 @@ jobs:
- name: Generate coverage report - name: Generate coverage report
run: | run: |
lcov -d . -c -o out.info --rc lcov_branch_coverage=1 --no-external lcov -d . -c -o out.info --rc lcov_branch_coverage=1 --no-external --filter branch --filter line
lcov -e out.info '*include/ss*hpp' -o filtered.info lcov -e out.info '*include/ss*hpp' -o filtered.info
- name: Invoke coveralls - name: Invoke coveralls

10
include/ss/parser.hpp
View File

@ -368,7 +368,10 @@ public:
template <typename U, typename... Us, typename Fun = none> template <typename U, typename... Us, typename Fun = none>
void try_convert_and_invoke(std::optional<U>& value, Fun&& fun) { void try_convert_and_invoke(std::optional<U>& value, Fun&& fun) {
if (!parser_.valid()) { if (parser_.valid()) {
return;
}
auto tuple_output = try_same<Us...>(); auto tuple_output = try_same<Us...>();
if (!parser_.valid()) { if (!parser_.valid()) {
return; return;
@ -382,7 +385,6 @@ public:
parser_.try_invoke(*value, std::forward<Fun>(fun)); parser_.try_invoke(*value, std::forward<Fun>(fun));
} }
}
template <typename U, typename... Us> template <typename U, typename... Us>
no_void_validator_tup_t<U, Us...> try_same() { no_void_validator_tup_t<U, Us...> try_same() {
@ -918,6 +920,7 @@ private:
} }
size_t remove_eol(char*& buffer, size_t ssize) { size_t remove_eol(char*& buffer, size_t ssize) {
// TODO write unit tests
if (buffer[ssize - 1] != '\n') { if (buffer[ssize - 1] != '\n') {
return ssize; return ssize;
} }
@ -940,7 +943,8 @@ private:
buffer_size = first_size + second_size + 3; buffer_size = first_size + second_size + 3;
auto new_first = static_cast<char*>( auto new_first = static_cast<char*>(
realloc(static_cast<void*>(first), buffer_size)); realloc(static_cast<void*>(first), buffer_size));
if (!first) { // TODO check
if (!new_first) {
throw std::bad_alloc{}; throw std::bad_alloc{};
} }

4
test/test_helpers.hpp
View File

@ -5,6 +5,8 @@
#include <sstream> #include <sstream>
#include <string> #include <string>
#include <vector> #include <vector>
#include <algorithm>
#include <fstream>
#ifdef CMAKE_GITHUB_CI #ifdef CMAKE_GITHUB_CI
#include <doctest/doctest.h> #include <doctest/doctest.h>
@ -134,7 +136,7 @@ template <typename T>
for (const auto& i : v) { for (const auto& i : v) {
for (auto j : inner_combinations) { for (auto j : inner_combinations) {
j.insert(j.begin(), i); j.insert(j.begin(), i);
ret.push_back(move(j)); ret.push_back(std::move(j));
} }
} }
return ret; return ret;