拆分csv数数据表

最新推荐文章于 2024-02-21 08:53:37 发布

weixin_30399871

最新推荐文章于 2024-02-21 08:53:37 发布

阅读量157

点赞数

原文链接：http://www.cnblogs.com/lz20150121/p/4494499.html

版权

std::string strTmp;
std::string subStrTmp;
int pos = 0;
int subPos1 = 0;
int subPos2 = 0;

Data fileData = FileUtils::getInstance()->getDataFromFile( FileUtils::getInstance()->fullPathForFilename( "data/SelectCard.csv" ) );
str.clear();
str.assign( (const char *)fileData.getBytes(), fileData.getSize() );

/* string 拆解
for( int i = 0; i < data.getSize(); i++ ) {
pos = str.find( "\n", i );
strTmp = str.substr( i, pos - i );
i = pos;
}
*/
for( unsigned int i = 0; i < str.size(); i++ ) {
pos = str.find( "\n", i );
strTmp = str.substr( i, pos - i );
// 拆数据，第一行不要
if( i != 0 ) {
selectCardData_s *data = new selectCardData_s;
subPos1 = 0;
//
subPos2 = strTmp.find( ",", subPos1 );
subStrTmp = strTmp.substr( subPos1, subPos2 - subPos1 );
data->id = atoi( subStrTmp.c_str() );
subPos1 = subPos2 + 1; // 需要自加，跳过分割符号
//
subPos2 = strTmp.find( ",", subPos1 );
subStrTmp = strTmp.substr( subPos1, subPos2 - subPos1 );
data->cardType = atoi( subStrTmp.c_str() );
subPos1 = subPos2 + 1;
//
subPos2 = strTmp.find( ",", subPos1 );
subStrTmp = strTmp.substr( subPos1, subPos2 - subPos1 );
data->rewardMultiple = atoi( subStrTmp.c_str() );
subPos1 = subPos2 + 1;
//
subPos2 = strTmp.find( ",", subPos1 );
subStrTmp = strTmp.substr( subPos1, subPos2 - subPos1 );
data->chance = atof( subStrTmp.c_str() );
subPos1 = subPos2 + 1;
// 记录数据
dataMap[ data->id ] = data;
}

if( pos == - 1 ) {
break;
}
i = pos;
}