mirror of
https://github.com/hanzo-cpp/sdk.git
synced 2026-11-20 19:55:32 +00:00
The projection these were generated from was a month old and predated the compute migration, so every one of them described /v1/visor — which the API serves at zero paths now. That is why a hand-written console client and a generated one had drifted the same way at the same time. No /v1/visor path survives here. The word still appears as a source-plane value and inside gvisor and supervisor, which are not this rename.
174 lines
4.4 KiB
C++
174 lines
4.4 KiB
C++
/**
|
|
* Hanzo Cloud API
|
|
* The Hanzo Cloud API as a customer calls it: every operation under /v1/ except the operator's admin product, relay routes, legacy spellings and capabilities still reached by flag. Tagged by product: the first path segment after /v1/.
|
|
*
|
|
* The version of the OpenAPI document: v1
|
|
*
|
|
* NOTE: This class is auto generated by OpenAPI-Generator 7.14.0.
|
|
* https://openapi-generator.tech
|
|
* Do not edit the class manually.
|
|
*/
|
|
|
|
/*
|
|
* Pairing.h
|
|
*
|
|
*
|
|
*/
|
|
|
|
#ifndef HANZO_MODEL_Pairing_H_
|
|
#define HANZO_MODEL_Pairing_H_
|
|
|
|
#include <boost/optional.hpp>
|
|
|
|
#include "hanzo/ModelBase.h"
|
|
|
|
#include <cpprest/details/basic_types.h>
|
|
|
|
namespace hanzo {
|
|
namespace model {
|
|
|
|
|
|
|
|
class Pairing
|
|
: public ModelBase
|
|
{
|
|
public:
|
|
Pairing();
|
|
virtual ~Pairing();
|
|
|
|
/////////////////////////////////////////////
|
|
/// ModelBase overrides
|
|
|
|
void validate() override;
|
|
|
|
web::json::value toJson() const override;
|
|
bool fromJson(const web::json::value& json) override;
|
|
|
|
void toMultipart(std::shared_ptr<MultipartFormData> multipart, const utility::string_t& namePrefix) const override;
|
|
bool fromMultiPart(std::shared_ptr<MultipartFormData> multipart, const utility::string_t& namePrefix) override;
|
|
|
|
|
|
/////////////////////////////////////////////
|
|
/// Pairing members
|
|
|
|
|
|
/// <summary>
|
|
/// A is the first model id.
|
|
/// </summary>
|
|
utility::string_t getA() const;
|
|
bool AIsSet() const;
|
|
void unseta();
|
|
void setA(const utility::string_t& value);
|
|
|
|
/// <summary>
|
|
/// ACorrect is how many of those common items A got right.
|
|
/// </summary>
|
|
int64_t getACorrect() const;
|
|
bool aCorrectIsSet() const;
|
|
void unsetA_correct();
|
|
void setACorrect(int64_t value);
|
|
|
|
/// <summary>
|
|
/// B is the second model id.
|
|
/// </summary>
|
|
utility::string_t getB() const;
|
|
bool BIsSet() const;
|
|
void unsetb();
|
|
void setB(const utility::string_t& value);
|
|
|
|
/// <summary>
|
|
/// BCorrect is how many of those common items B got right.
|
|
/// </summary>
|
|
int64_t getBCorrect() const;
|
|
bool bCorrectIsSet() const;
|
|
void unsetB_correct();
|
|
void setBCorrect(int64_t value);
|
|
|
|
/// <summary>
|
|
/// Benchmark is the catalog id the two arms were compared on.
|
|
/// </summary>
|
|
utility::string_t getBenchmark() const;
|
|
bool benchmarkIsSet() const;
|
|
void unsetBenchmark();
|
|
void setBenchmark(const utility::string_t& value);
|
|
|
|
/// <summary>
|
|
/// McnemarP is the two-sided exact binomial p on the discordant pairs. It is 1 when nothing is discordant, which is \"no evidence of a difference\", not an error.
|
|
/// </summary>
|
|
double getMcnemarP() const;
|
|
bool mcnemarPIsSet() const;
|
|
void unsetMcnemar_p();
|
|
void setMcnemarP(double value);
|
|
|
|
/// <summary>
|
|
/// NCommon is how many items BOTH arms completed. It is the denominator, and the reason this comparison is valid where a raw accuracy difference is not.
|
|
/// </summary>
|
|
int64_t getNCommon() const;
|
|
bool nCommonIsSet() const;
|
|
void unsetN_common();
|
|
void setNCommon(int64_t value);
|
|
|
|
/// <summary>
|
|
/// NetAMinusB is the two rescue counts subtracted — A's advantage in items.
|
|
/// </summary>
|
|
int64_t getNetAMinusB() const;
|
|
bool netAMinusBIsSet() const;
|
|
void unsetNet_a_minus_b();
|
|
void setNetAMinusB(int64_t value);
|
|
|
|
/// <summary>
|
|
/// RescueAOverB is how many items A got right and B got wrong.
|
|
/// </summary>
|
|
int64_t getRescueAOverB() const;
|
|
bool rescueAOverBIsSet() const;
|
|
void unsetRescue_a_over_b();
|
|
void setRescueAOverB(int64_t value);
|
|
|
|
/// <summary>
|
|
/// RescueBOverA is how many items B got right and A got wrong.
|
|
/// </summary>
|
|
int64_t getRescueBOverA() const;
|
|
bool rescueBOverAIsSet() const;
|
|
void unsetRescue_b_over_a();
|
|
void setRescueBOverA(int64_t value);
|
|
|
|
|
|
protected:
|
|
utility::string_t m_a;
|
|
bool m_aIsSet;
|
|
|
|
int64_t m_A_correct;
|
|
bool m_A_correctIsSet;
|
|
|
|
utility::string_t m_b;
|
|
bool m_bIsSet;
|
|
|
|
int64_t m_B_correct;
|
|
bool m_B_correctIsSet;
|
|
|
|
utility::string_t m_Benchmark;
|
|
bool m_BenchmarkIsSet;
|
|
|
|
double m_Mcnemar_p;
|
|
bool m_Mcnemar_pIsSet;
|
|
|
|
int64_t m_N_common;
|
|
bool m_N_commonIsSet;
|
|
|
|
int64_t m_Net_a_minus_b;
|
|
bool m_Net_a_minus_bIsSet;
|
|
|
|
int64_t m_Rescue_a_over_b;
|
|
bool m_Rescue_a_over_bIsSet;
|
|
|
|
int64_t m_Rescue_b_over_a;
|
|
bool m_Rescue_b_over_aIsSet;
|
|
|
|
};
|
|
|
|
|
|
}
|
|
}
|
|
|
|
#endif /* HANZO_MODEL_Pairing_H_ */
|