本文整理汇总了C++中data_t::insert方法的典型用法代码示例。如果您正苦于以下问题：C++ data_t::insert方法的具体用法？C++ data_t::insert怎么用？C++ data_t::insert使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类data_t的用法示例。
在下文中一共展示了data_t::insert方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: head
bool bin_index_t::dir_node::next(data_t& key,data_t& val) const
{
validate_key_len(key);
validate_index();
data_t head(key.begin(),key.begin()+parent.dir_key_len);
data_t tail(key.begin()+parent.dir_key_len,key.end());
datas_t::const_iterator it=std::lower_bound(indexes.begin(),indexes.end(),head,data_less_pr());
if(it==indexes.end())return false;
if(*it==head)
{
validate_sub(head);
if(sub_node->next(tail,val))
{
key=head;
key.insert(key.end(),tail.begin(),tail.end());
return true;
}
}
++it;
if(it==indexes.end())return false;
head=*it;
validate_sub(head);
if(!sub_node->first(tail,val))return false;
key=head;
key.insert(key.end(),tail.begin(),tail.end());
return true;
}示例2: Compress
void CTCPProfile::Compress(const data_t &data, data_t &output) {
size_t outputInSize = output.size();
const iphdr* ip = reinterpret_cast<const iphdr*>(&data[0]);
const tcphdr* tcp = reinterpret_cast<const tcphdr*>(ip+ip->ihl*4);
UpdateIpIdOffset(ip);
if (IR_State == state)
{
CreateIR(ip, tcp, output);
}
else
{
CreateCO(ip, tcp, output);
}
UpdateIpInformation(ip);
AdvanceState(false, false);
increaseMsn();
// Append payload
// TODO, handle TCP options
output.insert(output.end(), data.begin() + sizeof(iphdr) + sizeof(tcphdr), data.end());
++numberOfPacketsSent;
dataSizeCompressed += output.size() - outputInSize;
dataSizeUncompressed += data.size();
}示例3: distance
void
DUncompressedProfile::ParseCO(uint8_t packetTypeIndication, data_t &data, data_iterator pos, data_t &output)
{
// pti is first byte of IP
output.push_back(packetTypeIndication);
// data contains the rest
output.insert(output.end(), pos, data.end());
++numberOfPacketsReceived;
dataSizeCompressed += distance(pos, data.end()) + 1;
dataSizeUncompressed += distance(pos, data.end()) + 1;
}示例4:
bool bin_index_t::dir_node::first(data_t& key,data_t& val) const
{
validate_index();
if(indexes.empty())return false;
const data_t& head=indexes.front();
validate_sub(head);
data_t tail;
if(!sub_node->first(tail,val))return false;
key=head;
key.insert(key.end(),tail.begin(),tail.end());
return true;
}