Merge pull request #18 from svanveen/fix/container-types

Unify Argument::get and Argument::operator== for container types
This commit is contained in:
Pranav Srinivas Kumar 2019-05-14 19:59:31 -04:00 committed by GitHub
commit c03e34f981
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
4 changed files with 110 additions and 156 deletions

View File

@ -45,29 +45,40 @@ SOFTWARE.
namespace argparse { namespace argparse {
namespace { // anonymous namespace for helper methods - not visible outside this header file namespace { // anonymous namespace for helper methods - not visible outside this header file
// Some utility structs to check template specialization
template<typename Test, template<typename...> class Ref>
struct is_specialization : std::false_type {};
template<template<typename...> class Ref, typename... Args> template<typename... Ts>
struct is_specialization<Ref<Args...>, Ref> : std::true_type {}; struct is_container_helper {};
template<typename T, typename _ = void>
struct is_container : std::false_type {};
template<>
struct is_container<std::string> : std::false_type {};
template<typename T>
struct is_container<T, std::conditional_t<
false, is_container_helper<
typename T::value_type,
decltype(std::declval<T>().begin()),
decltype(std::declval<T>().end()),
decltype(std::declval<T>().size())
>, void>> : public std::true_type {
};
template<typename T>
static constexpr bool is_container_v = is_container<T>::value;
template <typename T>
using enable_if_container = std::enable_if_t<is_container_v<T>, T>;
template <typename T>
using enable_if_not_container = std::enable_if_t<!is_container_v<T>, T>;
// Check if string (haystack) starts with a substring (needle) // Check if string (haystack) starts with a substring (needle)
bool starts_with(const std::string& haystack, const std::string& needle) { bool starts_with(const std::string& haystack, const std::string& needle) {
return needle.length() <= haystack.length() return needle.length() <= haystack.length()
&& std::equal(needle.begin(), needle.end(), haystack.begin()); && std::equal(needle.begin(), needle.end(), haystack.begin());
} }
// Get value at index from std::list
template <typename T>
T get_from_list(const std::list<T>& aList, size_t aIndex) {
if (aList.size() > aIndex) {
auto tIterator = aList.begin();
std::advance(tIterator, aIndex);
return *tIterator;
}
return T();
}
} }
class Argument { class Argument {
@ -138,45 +149,31 @@ public:
return !(*this == aRhs); return !(*this == aRhs);
} }
// Entry point for template types other than std::vector and std::list /*
* Entry point for template non-container types
* @throws std::logic_error in case of incompatible types
*/
template <typename T> template <typename T>
typename std::enable_if<!is_specialization<T, std::vector>::value && std::enable_if_t <!is_container_v<T>, bool>
!is_specialization<T, std::list>::value, bool>::type operator==(const T& aRhs) const {
operator==(const T& aRhs) const {
return get<T>() == aRhs; return get<T>() == aRhs;
} }
// Template specialization for std::vector<...> /*
* Template specialization for containers
* @throws std::logic_error in case of incompatible types
*/
template <typename T> template <typename T>
typename std::enable_if<is_specialization<T, std::vector>::value, bool>::type std::enable_if_t <is_container_v<T>, bool>
operator==(const T& aRhs) const { operator==(const T& aRhs) const {
T tLhs = get<T>(); using ValueType = typename T::value_type;
auto tLhs = get<T>();
if (tLhs.size() != aRhs.size()) if (tLhs.size() != aRhs.size())
return false; return false;
else { else {
for (size_t i = 0; i < tLhs.size(); i++) { return std::equal(std::begin(tLhs), std::end(tLhs), std::begin(aRhs), [](const auto& lhs, const auto& rhs) {
auto tValueAtIndex = std::any_cast<typename T::value_type>(tLhs[i]); return std::any_cast<const ValueType&>(lhs) == rhs;
if (tValueAtIndex != aRhs[i]) });
return false;
}
return true;
}
}
// Template specialization for std::list<...>
template <typename T>
typename std::enable_if<is_specialization<T, std::list>::value, bool>::type
operator==(const T& aRhs) const {
T tLhs = get<T>();
if (tLhs.size() != aRhs.size())
return false;
else {
for (size_t i = 0; i < tLhs.size(); i++) {
auto tValueAtIndex = std::any_cast<typename T::value_type>(get_from_list(tLhs, i));
if (tValueAtIndex != get_from_list(aRhs, i))
return false;
}
return true;
} }
} }
@ -186,102 +183,43 @@ public:
return (starts_with(aName, "--") || starts_with(aName, "-")); return (starts_with(aName, "--") || starts_with(aName, "-"));
} }
// Getter for template types other than std::vector and std::list /*
* Getter for template non-container types
* @throws std::logic_error in case of incompatible types
*/
template <typename T> template <typename T>
typename std::enable_if<!is_specialization<T, std::vector>::value && enable_if_not_container<T>
!is_specialization<T, std::list>::value, T>::type
get() const { get() const {
if (mValues.empty()) { if (!mValues.empty()) {
if (mDefaultValue.has_value()) { return std::any_cast<T>(mValues.front());
return std::any_cast<T>(mDefaultValue);
}
else
return T();
} }
else { if (mDefaultValue.has_value()) {
if (!mRawValues.empty()) return std::any_cast<T>(mDefaultValue);
return std::any_cast<T>(mValues[0]);
else {
if (mDefaultValue.has_value())
return std::any_cast<T>(mDefaultValue);
else
return T();
}
} }
throw std::logic_error("No value provided");
} }
// Getter for std::vector. Here T = std::vector<...> /*
template <typename T> * Getter for container types
typename std::enable_if<is_specialization<T, std::vector>::value, T>::type * @throws std::logic_error in case of incompatible types
*/
template <typename CONTAINER>
enable_if_container<CONTAINER>
get() const { get() const {
T tResult; using ValueType = typename CONTAINER::value_type;
if (mValues.empty()) { CONTAINER tResult;
if (mDefaultValue.has_value()) { if (!mValues.empty()) {
T tDefaultValues = std::any_cast<T>(mDefaultValue); std::transform(std::begin(mValues), std::end(mValues),
for (size_t i = 0; i < tDefaultValues.size(); i++) { std::back_inserter(tResult), std::any_cast<ValueType>);
tResult.emplace_back(std::any_cast<typename T::value_type>(tDefaultValues[i])); return tResult;
}
return tResult;
}
else
return T();
} }
else { if (mDefaultValue.has_value()) {
if (!mRawValues.empty()) { const auto& tDefaultValues = std::any_cast<const CONTAINER&>(mDefaultValue);
for (const auto& mValue : mValues) { std::transform(std::begin(tDefaultValues), std::end(tDefaultValues),
tResult.emplace_back(std::any_cast<typename T::value_type>(mValue)); std::back_inserter(tResult), std::any_cast<ValueType>);
} return tResult;
return tResult;
}
else {
if (mDefaultValue.has_value()) {
std::vector<T> tDefaultValues = std::any_cast<std::vector<T>>(mDefaultValue);
for (size_t i = 0; i < tDefaultValues.size(); i++) {
tResult.emplace_back(std::any_cast<typename T::value_type>(tDefaultValues[i]));
}
return tResult;
}
else
return T();
}
}
}
// Getter for std::list. Here T = std::list<...>
template <typename T>
typename std::enable_if<is_specialization<T, std::list>::value, T>::type
get() const {
T tResult;
if (mValues.empty()) {
if (mDefaultValue.has_value()) {
T tDefaultValues = std::any_cast<T>(mDefaultValue);
for (size_t i = 0; i < tDefaultValues.size(); i++) {
tResult.emplace_back(std::any_cast<typename T::value_type>(get_from_list(tDefaultValues, i)));
}
return tResult;
}
else
return T();
}
else {
if (!mRawValues.empty()) {
for (const auto& mValue : mValues) {
tResult.emplace_back(std::any_cast<typename T::value_type>(mValue));
}
return tResult;
}
else {
if (mDefaultValue.has_value()) {
std::list<T> tDefaultValues = std::any_cast<std::list<T>>(mDefaultValue);
for (size_t i = 0; i < tDefaultValues.size(); i++) {
tResult.emplace_back(std::any_cast<typename T::value_type>(get_from_list(tDefaultValues, i)));
}
return tResult;
}
else
return T();
}
} }
throw std::logic_error("No value provided");
} }
std::vector<std::string> mNames; std::vector<std::string> mNames;
@ -368,26 +306,29 @@ class ArgumentParser {
parse_args_validate(); parse_args_validate();
} }
// Getter enabled for all template types other than std::vector and std::list /* Getter enabled for all template types other than std::vector and std::list
* @throws std::logic_error in case of an invalid argument name
* @throws std::logic_error in case of incompatible types
*/
template <typename T = std::string> template <typename T = std::string>
T get(const std::string& aArgumentName) { T get(const std::string& aArgumentName) {
auto tIterator = mArgumentMap.find(aArgumentName); auto tIterator = mArgumentMap.find(aArgumentName);
if (tIterator != mArgumentMap.end()) { if (tIterator != mArgumentMap.end()) {
return tIterator->second->get<T>(); return tIterator->second->get<T>();
} }
return T(); throw std::logic_error("No such argument");
} }
// Indexing operator. Return a reference to an Argument object /* Indexing operator. Return a reference to an Argument object
// Used in conjuction with Argument.operator== e.g., parser["foo"] == true * Used in conjuction with Argument.operator== e.g., parser["foo"] == true
* @throws std::logic_error in case of an invalid argument name
*/
Argument& operator[](const std::string& aArgumentName) { Argument& operator[](const std::string& aArgumentName) {
auto tIterator = mArgumentMap.find(aArgumentName); auto tIterator = mArgumentMap.find(aArgumentName);
if (tIterator != mArgumentMap.end()) { if (tIterator != mArgumentMap.end()) {
return *(tIterator->second); return *(tIterator->second);
} }
else { throw std::logic_error("No such argument");
throw std::runtime_error("Argument " + aArgumentName + " not found");
}
} }
// Printing the one and only help message // Printing the one and only help message
@ -461,12 +402,6 @@ class ArgumentParser {
} }
private: private:
// If the argument was defined by the user and can be found in mArgumentMap, then it's valid
bool is_valid_argument(const std::string& aName) {
auto tIterator = mArgumentMap.find(aName);
return (tIterator != mArgumentMap.end());
}
/* /*
* @throws std::runtime_error in case of any invalid argument * @throws std::runtime_error in case of any invalid argument
*/ */

View File

@ -1,6 +1,7 @@
#pragma once #pragma once
#include <catch.hpp> #include <catch.hpp>
#include <argparse.hpp> #include <argparse.hpp>
#include <test_utility.hpp>
TEST_CASE("Parse compound toggle arguments with implicit values", "[compound_arguments]") { TEST_CASE("Parse compound toggle arguments with implicit values", "[compound_arguments]") {
argparse::ArgumentParser program("test"); argparse::ArgumentParser program("test");
@ -97,9 +98,9 @@ TEST_CASE("Parse compound toggle arguments with implicit values and nargs and ot
REQUIRE(numbers[2] == 3); REQUIRE(numbers[2] == 3);
auto numbers_list = program.get<std::list<int>>("numbers"); auto numbers_list = program.get<std::list<int>>("numbers");
REQUIRE(numbers.size() == 3); REQUIRE(numbers.size() == 3);
REQUIRE(argparse::get_from_list(numbers_list, 0) == 1); REQUIRE(testutility::get_from_list(numbers_list, 0) == 1);
REQUIRE(argparse::get_from_list(numbers_list, 1) == 2); REQUIRE(testutility::get_from_list(numbers_list, 1) == 2);
REQUIRE(argparse::get_from_list(numbers_list, 2) == 3); REQUIRE(testutility::get_from_list(numbers_list, 2) == 3);
} }
TEST_CASE("Parse out-of-order compound arguments", "[compound_arguments]") { TEST_CASE("Parse out-of-order compound arguments", "[compound_arguments]") {

View File

@ -1,6 +1,7 @@
#pragma once #pragma once
#include <catch.hpp> #include <catch.hpp>
#include <argparse.hpp> #include <argparse.hpp>
#include <test_utility.hpp>
TEST_CASE("Parse vector of arguments", "[vector]") { TEST_CASE("Parse vector of arguments", "[vector]") {
argparse::ArgumentParser program("test"); argparse::ArgumentParser program("test");
@ -24,8 +25,8 @@ TEST_CASE("Parse list of arguments", "[vector]") {
auto inputs = program.get<std::list<std::string>>("input"); auto inputs = program.get<std::list<std::string>>("input");
REQUIRE(inputs.size() == 2); REQUIRE(inputs.size() == 2);
REQUIRE(argparse::get_from_list(inputs, 0) == "rocket.mesh"); REQUIRE(testutility::get_from_list(inputs, 0) == "rocket.mesh");
REQUIRE(argparse::get_from_list(inputs, 1) == "thrust_profile.csv"); REQUIRE(testutility::get_from_list(inputs, 1) == "thrust_profile.csv");
} }
TEST_CASE("Parse list of arguments with default values", "[vector]") { TEST_CASE("Parse list of arguments with default values", "[vector]") {
@ -38,11 +39,11 @@ TEST_CASE("Parse list of arguments with default values", "[vector]") {
auto inputs = program.get<std::list<int>>("--input"); auto inputs = program.get<std::list<int>>("--input");
REQUIRE(inputs.size() == 5); REQUIRE(inputs.size() == 5);
REQUIRE(argparse::get_from_list(inputs, 0) == 1); REQUIRE(testutility::get_from_list(inputs, 0) == 1);
REQUIRE(argparse::get_from_list(inputs, 1) == 2); REQUIRE(testutility::get_from_list(inputs, 1) == 2);
REQUIRE(argparse::get_from_list(inputs, 2) == 3); REQUIRE(testutility::get_from_list(inputs, 2) == 3);
REQUIRE(argparse::get_from_list(inputs, 3) == 4); REQUIRE(testutility::get_from_list(inputs, 3) == 4);
REQUIRE(argparse::get_from_list(inputs, 4) == 5); REQUIRE(testutility::get_from_list(inputs, 4) == 5);
REQUIRE(program["--input"] == std::list<int>{1, 2, 3, 4, 5}); REQUIRE(program["--input"] == std::list<int>{1, 2, 3, 4, 5});
} }

17
test/test_utility.hpp Normal file
View File

@ -0,0 +1,17 @@
#ifndef ARGPARSE_TEST_UTILITY_HPP
#define ARGPARSE_TEST_UTILITY_HPP
namespace testutility {
// Get value at index from std::list
template <typename T>
T get_from_list(const std::list<T>& aList, size_t aIndex) {
if (aList.size() > aIndex) {
auto tIterator = aList.begin();
std::advance(tIterator, aIndex);
return *tIterator;
}
return T();
}
}
#endif //ARGPARSE_TEST_UTILITY_HPP