packetpush
来源：互联网 发布：js实现购物车原理 编辑：程序博客网 时间：2024/06/06 06:51
int ::PushChar(char c)
{
int len = sizeof(c);
if(m_buff == NULL)
{
return -1;
}
if(m_offset + len > m_buff_size)
{
return -1;
}
m_buff[m_offset] = c;
m_offset += len;
return len;
}
int ::PushShort(short s)
{
int len = sizeof(s);
if(m_buff == NULL)
{
return -1;
}
if(m_offset + len > m_buff_size)
{
return -1;
}
memcpy(&m_buff[m_offset],&s,len);
m_offset += len;
return len;
}
int ::PushInt64(long long i)
{
int len = 8;
if(m_buff == NULL)
{
return -1;
}
if(m_offset + len > m_buff_size)
{
return -1;
}
memcpy(&m_buff[m_offset],&i,len);
m_offset += len;
return len;
}
int ::PushInt(int i)
{
int len = sizeof(i);
if(m_buff == NULL)
{
return -1;
}
if(m_offset + len > m_buff_size)
{
return -1;
}
memcpy(&m_buff[m_offset],&i,len);
m_offset += len;
return len;
}
int ::PushFloat(float f)
{
int len = sizeof(f);
if(m_buff == NULL)
{
return -1;
}
if(m_offset + len > m_buff_size)
{
return -1;
}
memcpy(&m_buff[m_offset],&f,len);
m_offset += len;
return len;
}
int ::PushDouble(double d)
{
int len = sizeof(d);
if(m_buff == NULL)
{
return -1;
}
if(m_offset + len > m_buff_size)
{
return -1;
}
memcpy(&m_buff[m_offset],&d,len);
m_offset += len;
return len;
}
int ::PushVS(const char *str)
{
if(m_buff == NULL || str == NULL)
{
return -1;
}
int len = strlen(str);
if(len > MAX_VS_DATA_SIZE)
len = 0;
if(m_offset + len +4> m_buff_size)
{
return -1;
}
//设置后续字符串的长度
PushInt(len);
if(len > 0)
{
memcpy(&m_buff[m_offset],str,len);
}
m_offset += len;
return len;
}
int ::PushIntArray(int nArray[],int len)
{
if(m_buff == NULL || nArray == NULL || len <=0)
{
return -1;
}
if(m_offset + len*4 +4> m_buff_size)
{
return -1;
}
int m_offset_old = m_offset;
PushInt(len);
for(int i=0;i<len;i++)
{
memcpy(&m_buff[m_offset],&(nArray[i]),sizeof(int));
m_offset += sizeof(int);
}
return m_offset - m_offset_old;
}
int ::PushIntVector(vector<int>intVector)
{
if(intVector.empty())
return -1;
int len = intVector.size();
if(m_offset + len*4 +4> m_buff_size)
{
return -1;
}
int m_offset_old = m_offset;
PushInt(len);
for(int i=0;i<len;i++)
{
//memcpy(&m_buff[m_offset],&(intVector[i]),sizeof(int));
//m_offset += sizeof(int);
PushInt(intVector[i]);
}
return m_offset-m_offset_old;
}
int ::PushBuff(const char *buff,int len)
{
if(m_buff == NULL || buff == NULL || len<0)
{
return -1;
}
if(len > MAX_BUF_DATA_SIZE)
len = 0;
if(m_offset + len +4> m_buff_size)
{
return -1;
}
//设置后续数据的长度
PushInt(len);
if(len > 0)
{
memcpy(&m_buff[m_offset],buff,len);
}
m_offset += len;
return len;
}
int GetLength()
{
return m_offset;
}
int GetData(char *buff, int size)
{
if(buff == NULL || size < m_offset)
{
return 0;
}
if(m_offset<1)
{
return 0;
}
memcpy(buff,m_buff,m_offset);
return m_offset;
}
