mirror of
https://github.com/hanzo-cpp/sdk.git
synced 2026-11-20 19:55:32 +00:00
The projection was 113 commits behind the document it claims to describe, and `generate.py --all --check` reported every one of the thirteen clients DRIFTED — the same +19 models in each, because they all fell behind the same emission. Regenerated in place from hanzo-inc/cloud openapi.yaml at 939b09d4 (sha256 087024f6…), which is the only description of this API that cannot name a route the binary does not serve. `--check` is clean across all thirteen after. .spec-lock moved with the code. The generator READS that file and never writes it — hanzoai/ci`s lane does — so a hand run leaves every lock naming the previous document. A lock that disagrees with the tree beside it is worse than no lock: the next `--check` without `--spec` fetches what production serves, compares it to a digest that was already wrong, and reports drift that is really staleness.
133 lines
8.0 KiB
C++
133 lines
8.0 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.
|
|
*/
|
|
|
|
/*
|
|
* SeoApi.h
|
|
*
|
|
*
|
|
*/
|
|
|
|
#ifndef HANZO_API_SeoApi_H_
|
|
#define HANZO_API_SeoApi_H_
|
|
|
|
|
|
|
|
#include "hanzo/ApiClient.h"
|
|
|
|
#include "hanzo/model/SeoAuditIn.h"
|
|
#include "hanzo/model/SeoAuditOut.h"
|
|
#include "hanzo/model/SeoBacklinkIn.h"
|
|
#include "hanzo/model/SeoBacklinkOut.h"
|
|
#include "hanzo/model/SeoCompetitorIn.h"
|
|
#include "hanzo/model/SeoCompetitorOut.h"
|
|
#include "hanzo/model/SeoIdeaIn.h"
|
|
#include "hanzo/model/SeoIdeaOut.h"
|
|
#include "hanzo/model/SeoKeywordIn.h"
|
|
#include "hanzo/model/SeoKeywordOut.h"
|
|
#include "hanzo/model/SeoRankIn.h"
|
|
#include "hanzo/model/SeoRankOut.h"
|
|
#include "hanzo/model/SeoRateOut.h"
|
|
#include <boost/optional.hpp>
|
|
|
|
namespace hanzo {
|
|
namespace api {
|
|
|
|
using namespace hanzo::model;
|
|
|
|
|
|
|
|
class SeoApi
|
|
{
|
|
public:
|
|
|
|
explicit SeoApi( std::shared_ptr<const ApiClient> apiClient );
|
|
|
|
virtual ~SeoApi();
|
|
|
|
/// <summary>
|
|
/// Fetch one page and report what it gets wrong
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// Fetches one page and reports what it gets wrong. It returns the page's on-page score, its title and description, how much readable text it carries, and the full set of named checks — is it https, does it have one h1, is the title duplicated, is it slow, is it a redirect, is anything on it broken. It is the technical half of search visibility, and it is the half a developer can act on this afternoon. ONE PAGE, LIVE, IN THIS REQUEST. It is deliberately not a site crawl: a crawl is a job with a lifecycle, and this answers the same questions about the page somebody is actually looking at, now, with no task id to poll. Point it at the pages that matter one at a time. It is priced per page fetched, which is one.
|
|
/// </remarks>
|
|
/// <param name="seoAuditIn"></param>
|
|
pplx::task<std::shared_ptr<SeoAuditOut>> seoAudit(
|
|
std::shared_ptr<SeoAuditIn> seoAuditIn
|
|
) const;
|
|
/// <summary>
|
|
/// Who links to a target, and how much of it is broken or spam
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// Summarises who links to a target. It returns the authority score, how many links point at it and from how many distinct sites, how many of those are broken, and how much of the profile reads as spam. Distinct sites is the number to read: a thousand links from one domain is one endorsement, and a profile that grew fast in links and not in domains is usually a profile somebody bought. The target can be a whole domain, a subdomain, or one page URL — the summary is scoped to whatever is named. It is priced per request, so a domain with ten million links costs the same as one with ten.
|
|
/// </remarks>
|
|
/// <param name="seoBacklinkIn"></param>
|
|
pplx::task<std::shared_ptr<SeoBacklinkOut>> seoBacklink(
|
|
std::shared_ptr<SeoBacklinkIn> seoBacklinkIn
|
|
) const;
|
|
/// <summary>
|
|
/// The domains that place for the same phrases
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// Names the domains that place for the same phrases. Given a set of phrases it returns the sites that appear across them, with each one's average position, how many of the phrases it places for, its share of the available attention and the visits that earns. It answers \"who am I actually up against here\", which is a different question from \"who do I think my competitors are\" and frequently a different answer. Pair it with seoRank: this says who is in the race, seoRank says where any one of them finishes. It is priced per row, so Limit decides the cost.
|
|
/// </remarks>
|
|
/// <param name="seoCompetitorIn"></param>
|
|
pplx::task<std::shared_ptr<SeoCompetitorOut>> seoCompetitor(
|
|
std::shared_ptr<SeoCompetitorIn> seoCompetitorIn
|
|
) const;
|
|
/// <summary>
|
|
/// Grow a seed phrase into the phrases nobody named yet
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// Grows a seed phrase into the phrases nobody named yet. It takes phrases you have and returns phrases in the same category that you do not — relevant rather than merely containing the seed — each with its search volume, click cost, competition and how hard its first page is to reach. This is where a keyword list comes FROM; seoKeyword is where a list you already have gets measured. It is priced per row, so Limit is the knob that decides what the call costs. Total says how many more there were.
|
|
/// </remarks>
|
|
/// <param name="seoIdeaIn"></param>
|
|
pplx::task<std::shared_ptr<SeoIdeaOut>> seoIdea(
|
|
std::shared_ptr<SeoIdeaIn> seoIdeaIn
|
|
) const;
|
|
/// <summary>
|
|
/// How often named phrases are searched, and what a click costs
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// Measures phrases the caller already has. It answers, for each phrase named, how many people search it in a month, what an advertising click on it costs, and how contested that advertising is. This is the ground fact of search: everything else on this surface is a question about phrases, and this is the one that says whether a phrase is worth having. Give it phrases you already suspect. To find phrases you have not thought of, use seoIdea; to find the ones a site already places for, use seoRank. The market defaults to the United States in English. It is priced per request rather than per phrase, so asking about fifty phrases costs what asking about one does.
|
|
/// </remarks>
|
|
/// <param name="seoKeywordIn"></param>
|
|
pplx::task<std::shared_ptr<SeoKeywordOut>> seoKeyword(
|
|
std::shared_ptr<SeoKeywordIn> seoKeywordIn
|
|
) const;
|
|
/// <summary>
|
|
/// Every phrase a domain already places for, with its position
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// Reports every phrase a domain already places for. For each one it gives the phrase, the position on the results page, the page of the site that placed, that result's headline, the phrase's monthly searches and the visits the placement is estimated to earn. It is the single most direct question about a site's search visibility — yours or a competitor's, since it takes any domain. Position is the ABSOLUTE rank, counting every element on the page — the ads, the answer boxes, the map — because that is what a person scrolling actually passes. An organic-only rank flatters a result that sits below half a screen of other things. It is priced per row, so Limit decides what the call costs, and Total says how many more there were.
|
|
/// </remarks>
|
|
/// <param name="seoRankIn"></param>
|
|
pplx::task<std::shared_ptr<SeoRankOut>> seoRank(
|
|
std::shared_ptr<SeoRankIn> seoRankIn
|
|
) const;
|
|
/// <summary>
|
|
/// What each call on this surface costs, from the vendor's own list
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// Publishes what every call on this surface costs. The numbers are read from the upstream's own published price list, not from a table kept here, so a price change on their side moves this card within the hour and moves what is debited with it. That is the whole of the pricing model: this surface resells at cost, and the cost is theirs to state. A row has two numbers because a call has two costs: a flat charge for asking, and a charge per row returned. An op priced per request reports zero for the second, and for one priced per row the total is `request + result x limit` — which is the amount your balance is authorized against before the call, and roughly what you will be debited after it. It is a read and it is free: asking what something costs must not require the balance that would pay for it. If the upstream cannot be reached the card comes back empty rather than stale — a price nobody can confirm is not a price.
|
|
/// </remarks>
|
|
pplx::task<std::shared_ptr<SeoRateOut>> seoRate(
|
|
) const;
|
|
|
|
protected:
|
|
std::shared_ptr<const ApiClient> m_ApiClient;
|
|
};
|
|
|
|
}
|
|
}
|
|
|
|
#endif /* HANZO_API_SeoApi_H_ */
|
|
|