kalshi-cpp 0.8.0
C++23 client for Kalshi's Predictions API
Loading...
Searching...
No Matches
kalshi::RFQBatchBestQuotes Struct Reference

#include <kalshi/models.hpp>

Public Attributes

std::string rfq_batch_id
 UUID of the RFQ batch.
 
RFQBatchStatus status {}
 
std::int64_t version {}
 Increases whenever a best bid changes.
 
std::optional< std::string > updated_ts
 When a best bid last changed.
 
bool yes_complete {}
 Whether every child has a YES bid, so the batch can be accepted on the yes side.
 
bool no_complete {}
 Whether every child has a NO bid, so the batch can be accepted on the no side.
 
std::vector< RFQBatchBestQuote > rfqs
 One entry per child RFQ, in batch order.
 

Member Data Documentation

◆ rfq_batch_id

std::string kalshi::RFQBatchBestQuotes::rfq_batch_id

UUID of the RFQ batch.

◆ status

RFQBatchStatus kalshi::RFQBatchBestQuotes::status {}

◆ version

std::int64_t kalshi::RFQBatchBestQuotes::version {}

Increases whenever a best bid changes.

◆ updated_ts

std::optional<std::string> kalshi::RFQBatchBestQuotes::updated_ts

When a best bid last changed.

◆ yes_complete

bool kalshi::RFQBatchBestQuotes::yes_complete {}

Whether every child has a YES bid, so the batch can be accepted on the yes side.

◆ no_complete

bool kalshi::RFQBatchBestQuotes::no_complete {}

Whether every child has a NO bid, so the batch can be accepted on the no side.

◆ rfqs

std::vector<RFQBatchBestQuote> kalshi::RFQBatchBestQuotes::rfqs

One entry per child RFQ, in batch order.


The documentation for this struct was generated from the following file: