[llvm-commits] CVS: llvm/test/Programs/SingleSource/Benchmarks/Shootout-C++/wordfreq.cpp

[Chris Lattner]

Changes in directory llvm/test/Programs/SingleSource/Benchmarks/Shootout-C++:

wordfreq.cpp added (r1.1)

---
Log message:

new testcase


---
Diffs of the changes:  (+98 -2)

Index: llvm/test/Programs/SingleSource/Benchmarks/Shootout-C++/wordfreq.cpp
diff -c /dev/null llvm/test/Programs/SingleSource/Benchmarks/Shootout-C++/wordfreq.cpp:1.1
*** /dev/null	Mon Oct  6 20:09:19 2003
--- llvm/test/Programs/SingleSource/Benchmarks/Shootout-C++/wordfreq.cpp	Mon Oct  6 20:09:09 2003
***************
*** 0 ****
--- 1,98 ----
+ // -*- mode: c++ -*-
+ // $Id: wordfreq.cpp,v 1.1 2003/10/07 01:09:09 lattner Exp $
+ // http://www.bagley.org/~doug/shootout/
+ // By Tamás Benkõ
+ 
+ #include <cstdio>
+ #include <cctype>
+ #include <cstring>
+ #include <ext/hash_map>
+ #include <vector>
+ #include <algorithm>
+ 
+ using namespace std;
+ 
+ int const bufsize = 4096;
+ int const wsize = 64;
+ 
+ class word_reader
+ {
+     int ws;
+     char buf[bufsize+1], *bptr, *word;
+     FILE *input;
+ 
+     bool fill();
+ 
+ public:
+     word_reader(FILE *i): ws(wsize), bptr(buf), word(new char[ws+1]), input(i)
+ 	{*bptr = *word = '\0';}
+     int operator()(char const **);
+ };
+ 
+ inline bool word_reader::fill()
+ {
+     int nread = fread(buf, sizeof(char), bufsize, input);
+     buf[nread] = '\0';
+     bptr = buf;
+     return nread > 0;
+ }
+ 
+ int word_reader::operator()(char const **w)
+ {
+     int len = 0;
+     char c;
+     while (*bptr || fill()) {
+ 	if (isalpha(c = *bptr++)) {
+ 	    word[len] = tolower(c);
+ 	    if (++len == ws) {
+ 		char *nword = new char[(ws *= 2)+1];
+ 		memcpy(nword, word, len);
+ 		delete[] word;
+ 		word = nword;
+ 	    }
+ 	}
+ 	else if (len > 0) break;
+     }
+     *w = word;
+     word[len] = '\0';
+     return len;
+ }
+ 
+ typedef hash_map<char const *, int> counter;
+ typedef pair<char const *, int> hpair;
+ 
+ namespace std
+ {
+     inline bool operator<(hpair const &lhs, hpair const &rhs)
+     {
+ 	return lhs.second != rhs.second ? lhs.second > rhs.second
+ 	    : strcmp(lhs.first, rhs.first) > 0;
+     }
+ 
+     template<> struct equal_to<char const *>
+     {
+ 	bool operator()(char const *s1, char const *s2) const
+ 	    {return strcmp(s1, s2) == 0;}
+     };
+ }
+ 
+ int main()
+ {
+     int len;
+     const char *w;
+     counter hist;
+     word_reader wr(stdin);
+ 
+     while ((len = wr(&w)) > 0) {
+ 	counter::iterator i = hist.find(w);
+ 	if (i == hist.end()) hist[strcpy(new char[len+1], w)] = 1;
+ 	else ++i->second;
+     }
+ 
+     vector<hpair> v(hist.begin(), hist.end());
+     sort(v.begin(), v.end());
+     for (size_t i = 0; i < v.size(); ++i)
+ 	printf("%7d\t%s\n", v[i].second, v[i].first);
+ 
+     return 0;
+ }