{"id":5996,"date":"2023-08-19T00:01:05","date_gmt":"2023-08-19T07:01:05","guid":{"rendered":"https:\/\/c-for-dummies.com\/blog\/?p=5996"},"modified":"2023-08-12T09:39:35","modified_gmt":"2023-08-12T16:39:35","slug":"the-camelcase-to-snake_case-conversion-with-proper-memory-allocation","status":"publish","type":"post","link":"https:\/\/c-for-dummies.com\/blog\/?p=5996","title":{"rendered":"The camelCase to snake_case Conversion with Proper Memory Allocation"},"content":{"rendered":"

With all the storage available in a modern computer, it’s easy — and often perfectly okay — to be overly generous when allocating memory. Still, the old coder in me has a lingering desire to save every byte possible. So when it comes to crafting a solution for this month’s Exercise<\/a>, my desire is to be byte stingy.
\n
\nThe issue for this week’s Lesson isn’t to convert between camelCase and snake_case, but rather to perfectly allocate storage for the converted strings.<\/p>\n

For the snake_case to camelCase conversion, fewer characters are required. My approach is to count the number of underscores in the original name, then allocate storage based on the original name’s string size, minus the number of underscores.<\/p>\n

For the camelCase to snake_case conversion, more characters are required. The quantity depends on the number of uppercase characters found in the name. For each uppercase character, an underscore is added. To allocate storage, I use the original string’s size, plus the number of uppercase characters found.<\/p>\n

Here is my new solution:<\/p>\n

2023_08_19-Lesson.c<\/a><\/h3>\n
\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n#include <ctype.h>\r\n\r\nint main()\r\n{\r\n    const int count = 7;\r\n    char *variable[] = {\r\n        \"readInputMeter\",\r\n        \"cyclical_redundancy_check\",\r\n        \"bumpyRide\",\r\n        \"search_for_node\",\r\n        \"string_convert\",\r\n        \"divideByZeroError\",\r\n        \"giveUpAndExplode\"\r\n    };\r\n    char *v[count];\r\n    int x,c,us,caps;\r\n    char *n;\r\n\r\n    for(x=0; x<count; x++ )\r\n    {\r\n        n = variable[x];        \/* initialize pointer n *\/<\/span>\r\n        c = 0;                    \/* initialize offset *\/<\/span>\r\n\r\n        \/* test for the underscore *\/<\/span>\r\n        if( strchr(variable[x],'_') )\r\n        {\r\n            \/* name is in snake_case *\/<\/span>\r\n            \/* count the underscores *\/<\/span>\r\n            us = 0;\r\n            while( *n )\r\n            {\r\n                if( *n=='_' )\r\n                    us++;\r\n                n++;\r\n            }\r\n            \/* re-initialize n *\/<\/span>\r\n            n = variable[x];\r\n            \/* allocate proper storage *\/<\/span>\r\n            v[x] = malloc( strlen(variable[x]) - us + 1 );\r\n            if( v[x]==NULL )\r\n            {\r\n                fprintf(stderr,\"Memory allocate error\\n\");\r\n                exit(1);\r\n            }\r\n            \/* build the new string *\/<\/span>\r\n            while( *n )\r\n            {\r\n                if( *n=='_' )\r\n                {\r\n                    n++;\r\n                    *(v[x]+c) = toupper(*n);\r\n                }\r\n                else\r\n                {\r\n                    *(v[x]+c) = *n;\r\n                }\r\n                n++;\r\n                c++;\r\n            }\r\n        }\r\n        else\r\n        {\r\n            \/* name is in camelCase *\/<\/span>\r\n            \/* count the capital letters *\/<\/span>\r\n            caps = 0;\r\n            while( *n )\r\n            {\r\n                if( isupper(*n) )\r\n                    caps++;\r\n                n++;\r\n            }\r\n            \/* re-initialize n *\/<\/span>\r\n            n = variable[x];\r\n            \/* allocate proper storage *\/<\/span>\r\n            v[x] = malloc( strlen(variable[x]) + caps + 1 );\r\n            if( v[x]==NULL )\r\n            {\r\n                fprintf(stderr,\"Memory allocate error\\n\");\r\n                exit(1);\r\n            }\r\n            \/* build the new string *\/<\/span>\r\n            while( *n )\r\n            {\r\n                if( isupper(*n) )\r\n                {\r\n                    *(v[x]+c) = '_';\r\n                    c++;\r\n                    *(v[x]+c) = tolower(*n);\r\n                }\r\n                else\r\n                {\r\n                    *(v[x]+c) = *n;\r\n                }\r\n                n++;\r\n                c++;\r\n            }\r\n        }\r\n        \/* cap the string *\/<\/span>\r\n        *(v[x]+c) = '\\0';\r\n    }\r\n\r\n    \/* output the result *\/<\/span>\r\n    for(x=0; x<count; x++ )\r\n        printf(\"%25s -> %s\\n\",\r\n                variable[x],\r\n                v[x]\r\n              );\r\n\r\n    return(0);\r\n}<\/pre>\n
For the string_case to camelCase conversion, the number of underscores are saved in variable us<\/code>. This variable is used to calculate needed storage for the converted string:<\/p>\n
v[x] = malloc( strlen(variable[x]) - us + 1 );<\/code><\/p>\n
The underscore character count (us<\/code>) is subtracted from the original string’s length: strlen(variable[x])<\/code> Then one is added to create storage for the new string.<\/p>\n
When converting from camelCase to string_case, the number of capital letters found is stored in variable caps<\/code>. This value is added to the original string’s length to allocate storage for the new string:<\/p>\n
v[x] = malloc( strlen(variable[x]) + caps + 1 );<\/code><\/p>\n
Honestly, in the era of multi-gigabyte computers, quibbling over a handful of bytes here and there is silly. Yet it’s always good practice to be accurate, especially when dealing with larger memory chunks.<\/p>\n
The other aspect of this month’s Exercise is to properly detect whether a name is true camelCase or snake_case. I decided not to pursue this angle, though I may cover such detection methods in a future Lesson.<\/p>\n","protected":false},"excerpt":{"rendered":"
Yes, you can allocate too much memory, but you can also do the coding to make the allocation perfect. 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-5996","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\/5996","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=5996"}],"version-history":[{"count":3,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/5996\/revisions"}],"predecessor-version":[{"id":6003,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/5996\/revisions\/6003"}],"wp:attachment":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=5996"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=5996"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=5996"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}