{"id":5113,"date":"2022-01-01T00:01:08","date_gmt":"2022-01-01T08:01:08","guid":{"rendered":"https:\/\/c-for-dummies.com\/blog\/?p=5113"},"modified":"2022-01-15T08:47:15","modified_gmt":"2022-01-15T16:47:15","slug":"a-tally-of-unique-words-part-iv","status":"publish","type":"post","link":"https:\/\/c-for-dummies.com\/blog\/?p=5113","title":{"rendered":"A Tally of Unique Words, Part IV"},"content":{"rendered":"

In our last episode<\/a>, the unique words code is able to parse and list individual words in the buffer. To find unique and duplicate words, the next step is to sort the list.
\n
\nThe word list is held in a dynamically allocated array of pointers, **list<\/code>. To sort this list, I use my old pal the qsort()<\/em> function<\/a>. The function has this horrible man<\/em> page format:<\/p>\n

void qsort(void *base, size_t nel, size_t width, int (*compar)(const void *, const void *));<\/code><\/p>\n

The first argument is the base of the list to sort. For my word list, it’s the name of the **list<\/code> pointer: list<\/code>. That’s it, no asteriskses.<\/p>\n

The second argument is the number of items to sort. In the code, this quantity is stored in the count<\/code> variable. So far so good.<\/p>\n

The third argument is the comparison function, which is pretty much boilerplate except that the items to be sorted are in a double-pointer list. Fret not! I’ve already covered this topic in an older blog post<\/a>.<\/p>\n

To update the code, the compare()<\/em> function is added before the main()<\/em> function:<\/p>\n

\r\nint compare(const void *a, const void *b)\r\n{\r\n    return( strcmp( *(const char **)a, *(const char **)b ));\r\n}<\/pre>\n
Again, read my previous blog post if you want to assure yourself that I didn’t just randomly type asterisks in that return<\/em> statement.<\/p>\n
The other change to the code is to add the qsort()<\/em> function between the final while<\/em> and for<\/em> loops:<\/p>\n
qsort(list,count,sizeof(char *),compare);<\/code><\/p>\n
That’s it. The list is sorted. Here is some of the program’s output:<\/p>\n
  1:And
\n  2:And
\n  3:And
\n  4:But
\n  5:By
\n  6:I
\n...
\n107:to
\n108:to
\n109:to
\n110:too
\n111:too
\n112:untrimmed
\n113:wand'rest
\n114:winds<\/code><\/p>\n
The list is sorted and the duplicates are easy to spy. But one problem is apparent right away if you peruse the entire list: The sorting method doesn’t catch any case differences. The list shows three uppercase words And<\/em> and two lowercase words and<\/em> separately.<\/p>\n
This fix for this problem is rather sneaky: Replace the strcmp()<\/em> function in the compare()<\/em> function’s return<\/em> statement with strcasecamp()<\/em>, which compares strings without regards to letter case.<\/p>\n
The strcasecmp()<\/em> function isn’t part of the standard C library. To use it, you must include the strings.h<\/code> header file. You could use my own version of the function<\/a>, but it has a flaw: It’s unable to distinguish between matching words of different lengths, such as “to” and “too.” I have an update to my own strcasecmp()<\/em> function coming in a future Lesson<\/a>.<\/p>\n
Click here<\/a> to view the all the modifications to the code on GitHub. In this update, the strcmp()<\/em> is replaced with strcasecmp()<\/em> in the compare()<\/em> function. Oh, and the strings.h<\/code> header file is included.<\/p>\n
Here is the updated output:<\/p>\n
  1:a
\n  2:a
\n  3:all
\n  4:And
\n  5:And
\n  6:and
\n...
\n107:to
\n108:to
\n109:too
\n110:too
\n111:untrimmed
\n112:wand'rest
\n113:When
\n114:winds<\/code><\/p>\n
You can see the all duplicates right away, regardless of case. The next step is to add code to find the unique words and the duplicates. This update is covered in next week’s Lesson<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"
To find unique words in a let, you start by sorting the list. Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2],"tags":[],"class_list":["post-5113","post","type-post","status-publish","format-standard","hentry","category-main"],"_links":{"self":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/5113","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=5113"}],"version-history":[{"count":9,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/5113\/revisions"}],"predecessor-version":[{"id":5166,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/5113\/revisions\/5166"}],"wp:attachment":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=5113"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=5113"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=5113"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}