blocks|key|1037627|text|我建议不要使用除malloc、free、strlen、memcpy和snprintf之外的任何库。这些函数为您提供了在C中进行强大、安全和高效的字符串处理的所有工具。只要远离strcpy、strcat、strncpy和strncat，所有这些都会导致低效和可利用的bug。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1037628|既然你提到了搜索，无论你选择什么库，strchr和strstr几乎都是你想要使用的。strspn和strcspn也很有用。|1037629|entityMap^0|8|6|F|4|K|6|R|6|Y|8|2F|6|2M|6|2T|7|31|7|0|I|6|P|6|16|6|1D|7|0^^$0|@$1|2|3|4|5|6|7|J|8|@$9|K|A|L|B|C]|$9|M|A|N|B|C]|$9|O|A|P|B|C]|$9|Q|A|R|B|C]|$9|S|A|T|B|C]|$9|U|A|V|B|C]|$9|W|A|X|B|C]|$9|Y|A|Z|B|C]|$9|10|A|11|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|12|8|@$9|13|A|14|B|C]|$9|15|A|16|B|C]|$9|17|A|18|B|C]|$9|19|A|1A|B|C]]|D|@]|E|$]]|$1|H|3|-4|5|6|7|1B|8|@]|D|@]|E|$]]]|I|$]]

I would suggest not using any library aside from <code>malloc</code>, <code>free</code>, <code>strlen</code>, <code>memcpy</code>, and <code>snprintf</code>. These functions give you all of the tools for powerful, safe, and efficient string processing in C. Just stay away from <code>strcpy</code>, <code>strcat</code>, <code>strncpy</code>, and <code>strncat</code>, all of which tend to lead to inefficiency and exploitable bugs.

Since you mentioned searching, whatever choice of library you make, <code>strchr</code> and <code>strstr</code> are almost certainly going to be what you want to use. <code>strspn</code> and <code>strcspn</code> can also be useful.

blocks|key|822662|text|请查看milkstrings。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|822663|示例代码：|822664|int+main(int+argc,+char+*+argv[])+{
++tXt+s+=+"123,456,789"+;
++s+=+txtReplace(s,"123","321")+;+//+replace+123+by+321
++int+num+=+atoi(txtEat(&s,','))+;+//+pick+the+first+number
++printf("num+=+%25d+s+=+%25s+\n",num,s)+;
++s+=+txtPrintf("%25s,%25d",s,num)+;+//+printf+in+new+string
++printf("num+=+%25d+s+=+%25s+\n",num,s)+;
++s+=+txtConcat(s,"<-->",txtFlip(s),NULL)+;+//+concatenate+some+strings
++num+=+txtPos(s,"987")+;+//+find+position+of+substring
++printf("num+=+%25d+s+=+%25s+\n",num,s)+;
++if+(txtAnyError())+{+//check+for+errors
++++printf("%25s\n",txtLastError())+;
++++return+1+;+}
++return+0+;
++}|code-block|syntax|javascript|822665|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/spitstec/milkstrings^0|3|B|0|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@$A|T|B|U|1|V]]|C|$]]|$1|D|3|E|5|6|7|W|8|@]|9|@]|C|$]]|$1|F|3|G|5|H|7|X|8|@]|9|@]|C|$I|J]]|$1|K|3|-4|5|6|7|Y|8|@]|9|@]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]]]

Please check <a href="https://github.com/spitstec/milkstrings" rel="nofollow">milkstrings</a>.
 Sample code :

<pre><code>int main(int argc, char * argv[]) {
 tXt s = "123,456,789" ;
 s = txtReplace(s,"123","321") ; // replace 123 by 321
 int num = atoi(txtEat(&amp;s,',')) ; // pick the first number
 printf("num = %d s = %s \n",num,s) ;
 s = txtPrintf("%s,%d",s,num) ; // printf in new string
 printf("num = %d s = %s \n",num,s) ;
 s = txtConcat(s,"&lt;--&gt;",txtFlip(s),NULL) ; // concatenate some strings
 num = txtPos(s,"987") ; // find position of substring
 printf("num = %d s = %s \n",num,s) ;
 if (txtAnyError()) { //check for errors
 printf("%s\n",txtLastError()) ;
 return 1 ; }
 return 0 ;
 }
</code></pre>

blocks|key|1037732|text|我最近遇到了这个问题，需要附加数百万个字符的字符串。我最终做了我自己的。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1037733|它只是一个C字符数组，封装在一个类中，用于跟踪数组大小和分配的字节数。|1037734|与SDS和std::string相比，在以下基准测试下，性能提高了10倍|1037735|在…|1037736|https://github.com/pedro-vicente/table-string|offset|length|1037737|基准测试|1037738|对于Visual+Studio+2015，x86调试版本：|1037739|%7C+API+++++++++++++++++++%7C+Seconds+++++++++++
%7C+----------------------%7C----%7C+
%7C+SDS+++++++++++++++++++%7C+19+%7C++
%7C+std::string+++++++++++%7C+11+%7C++
%7C+std::string+(reserve)+%7C+9++%7C++
%7C+table_str_t+++++++++++%7C+1++%7C++

clock_gettime_t+timer;
const+size_t+nbr+=+1000+*+1000+*+10;
const+char*+s+=+"bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb";
size_t+len+=+strlen(s);
timer.start();
table_str_t+table(nbr+*len);
for+(size_t+idx+=+0;+idx+<+nbr;+%2B%2Bidx)
{
++table.add(s,+len);
}
timer.now("end+table");
timer.stop();|code-block|syntax|javascript|1037740|EDIT通过在开始时分配字符串all+(构造函数参数大小)来实现最高性能。如果使用总大小的一小部分，则性能会下降。具有100个分配的示例：|1037741|std::string+benchmark+append+string+of+size+33,+10000000+times
end+str:++++++++11.0+seconds++++11.0+total
std::string+reserve+benchmark+append+string+of+size+33,+10000000+times
end+str+reserve:++++++++10.0+seconds++++10.0+total
table+string+benchmark+with+pre-allocation+of+330000000+elements
end+table:++++++1.0+seconds+++++1.0+total
table+string+benchmark+with+pre-allocation+of+ONLY+3300000+elements,+allocation+is+MADE+100+times...patience...
end+table:++++++9.0+seconds+++++9.0+total|1037742|entityMap|0|LINK|mutability|MUTABLE|url^0|0|0|0|0|0|19|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|15|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|16|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|17|8|@]|9|@]|A|$]]|$1|F|3|G|5|6|7|18|8|@]|9|@]|A|$]]|$1|H|3|I|5|6|7|19|8|@]|9|@$J|1A|K|1B|1|1C]]|A|$]]|$1|L|3|M|5|6|7|1D|8|@]|9|@]|A|$]]|$1|N|3|O|5|6|7|1E|8|@]|9|@]|A|$]]|$1|P|3|Q|5|R|7|1F|8|@]|9|@]|A|$S|T]]|$1|U|3|V|5|6|7|1G|8|@]|9|@]|A|$]]|$1|W|3|X|5|R|7|1H|8|@]|9|@]|A|$S|T]]|$1|Y|3|-4|5|6|7|1I|8|@]|9|@]|A|$]]]|Z|$10|$5|11|12|13|A|$14|I]]]]

I faced this problem recently, the need for appending a string with millions of characters. I ended up doing my own.

It is simply a C array of characters, encapsulated in a class that keeps track of array size and number of allocated bytes.

The performance compared to SDS and std::string is 10 times faster with the benchmark below

at

<a href="https://github.com/pedro-vicente/table-string" rel="nofollow noreferrer">https://github.com/pedro-vicente/table-string</a>

<h1>Benchmarks</h1>

For Visual Studio 2015, x86 debug build:

<pre><code>| API | Seconds 
| ----------------------|----| 
| SDS | 19 | 
| std::string | 11 | 
| std::string (reserve) | 9 | 
| table_str_t | 1 | 

clock_gettime_t timer;
const size_t nbr = 1000 * 1000 * 10;
const char* s = "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb";
size_t len = strlen(s);
timer.start();
table_str_t table(nbr *len);
for (size_t idx = 0; idx &lt; nbr; ++idx)
{
 table.add(s, len);
}
timer.now("end table");
timer.stop();
</code></pre>

EDIT 
Maximum performance is achieved by allocating the string all at start (constructor parameter size). If a fraction of total size is used, performance drops. Example with 100 allocations:

<pre><code>std::string benchmark append string of size 33, 10000000 times
end str: 11.0 seconds 11.0 total
std::string reserve benchmark append string of size 33, 10000000 times
end str reserve: 10.0 seconds 10.0 total
table string benchmark with pre-allocation of 330000000 elements
end table: 1.0 seconds 1.0 total
table string benchmark with pre-allocation of ONLY 3300000 elements, allocation is MADE 100 times...patience...
end table: 9.0 seconds 9.0 total
</code></pre>

I recently got inspired to start up a project I've been wanting to code for a while. I want to do it in C, because memory handling is key this application. I was searching around for a good implementation of strings in C, since I know me doing it myself could lead to some messy buffer overflows, and I expect to be dealing with a fairly big amount of strings.

I found <a href="http://www.and.org/vstr/comparison" rel="noreferrer">this</a> article which gives details on each, but they each seem like they have a good amount of cons going for them (don't get me wrong, this article is EXTREMELY helpful, but it still worries me that even if I were to choose one of those, I wouldn't be using the best I can get). I also don't know how up to date the article is, hence my current plea. 

What I'm looking for is something that may hold a large amount of characters, and simplifies the process of searching through the string. If it allows me to tokenize the string in any way, even better. Also, it should have some pretty good I/O performance. Printing, and formatted printing isn't quite a top priority. I know I shouldn't expect a library to do all the work for me, but was just wandering if there was a well documented string function out there that could save me some time and some work.

Any help is greatly appreciated. Thanks in advance!

EDIT: I was asked about the license I prefer. Any sort of open source license will do, but preferably GPL (v2 or v3).

EDIt2: I found betterString (bstring) library and it looks pretty good. Good documentation, small yet versatile amount of functions, and easy to mix with c strings. Anyone have any good or bad stories about it? The only downside I've read about it is that it lacks Unicode (again, read about this, haven't seen it face to face just yet), but everything else seems pretty good.

EDIT3: Also, preferable that its pure C.

Good C string library

Visual Studio

我最近受到了启发，开始了一个我一直想要编写代码的项目。我想用C语言实现，因为内存处理是这个应用程序的关键。我在C中寻找一个好的字符串实现，因为我知道我自己做可能会导致一些混乱的缓冲区溢出，并且我希望处理相当大量的字符串。我找到了的文章，给出了每一个的细节，但它们似乎都有很多缺点(不要误会我，这篇文章非常有帮助，但它仍然...

问好的C字符串库
EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问好的C字符串库EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问好的C字符串库
EN