From my university experience, my personal projects, and my volunteer work on web apps and tutoring, I have learned that developing software is like a battle. I know conflict is a tired metaphor but stick with me for a bit. In this metaphorical battle the programmer struggles against numerous and varied adversaries. Among these foes are functional constraints like “I must get the computer to render a convincing ocean at 60+ frames per second,” logistical constraints like “I need to communicate this really complex idea quickly to my teammates,” and operational constraints like “I need other developers to be able to work with this code base in the future.” It is this last ostensible category, and indeed this last example, that begets the need for clean code.<\/p>\n\n\n\n
“Clean code” is simply quickly comprehensible code. It tends to be free of “smells” which are indicators that your code could be simpler, more descriptive, or simply more intuitive. Is my code pristine, does it smell perfectly fresh? No, of course not, and I found a reasonably comprehensive article<\/a> to benchmark against so I can show you why not. Let’s look at a simple piece of code I wrote to fill a two channel (two numbers stored per pixel) texture with random data and let’s compare this code against the article.<\/p>\n\n\n\n This is littered with under-descriptive names (#28) “size,” “data”. The single comment isn’t actually in the right place (which would probably be above channels), and doesn’t explain why (#1 in the code smells list) I’m pushing a bunch of random data into the image. I’m sure there are more things beside that that I’m blind to as well (I am looking at my own code after all). And this is after<\/em> one refactor. Originally, this code was part of another function which created three different images of varying formats (doing multiple things is discussed in #9). Even now that other function contains duplicated code in the form of an identical texture_extent definition (#2 in the list). So I have terrible code in some respects. When under time pressure, it can be difficult to write clean code, and I still struggle to do so when I’m quickly prototyping.<\/p>\n\n\n\n That said, I manage some things better than I used to. One particularly clear article<\/a> clearly explains a simple technique for clean code in Rust. It tells us how to use built-in functions to avoid the “nestiness” of rust. What do I mean by “nestiness”? Well everything is a block in Rust, functions, match clauses, if-let statements, loops, closures (lambdas), structure definitions (which can be nested), structure declarations, trait implementations, you get the picture. With all those opportunities, it’s easy to nest more than 3 blocks deep if you aren’t careful. The article clearly discusses one way to deal with this is by using functions which call other functions under certain conditions. The standard library is full of these “adapters<\/a>” and utility functions. I used adapter utility methods often in my citygen project for a previous course. I wouldn’t say that the code in citygen is clean overall, but I did work hard to avoid significant nesting. See the example<\/a> below. (Still has poor names, oh well.)<\/p>\n\n\n This post is long enough now, but to close I’ll say from looking at code around the internet, and at my own, it’s is easy to criticize, but hard to actually fix. The difficulty is exacerbated when you’re under the pressures of time constraints or you’re struggling to meet functional constraints. Hopefully in the future I can build in the time necessary to step back from the code and really check it for numerous code smells. By spending more time I might be able to fend off the adversary of deadlines long enough to finally emerge victorious over the notorious squad of code smells.<\/p>\n\n\n\n Thanks for reading!<\/p>\n","protected":false},"excerpt":{"rendered":" From my university experience, my personal projects, and my volunteer work on web apps and tutoring, I have learned that developing software is like a battle. I know conflict is a tired metaphor but stick with me for a bit. In this metaphorical battle the programmer struggles against numerous and varied adversaries. Among these foes […]<\/p>\n","protected":false},"author":12972,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[7],"tags":[20,19,22,21,14,23],"class_list":["post-41","post","type-post","status-publish","format-standard","hentry","category-capstone-project","tag-clean-code","tag-code-smells","tag-efficiency","tag-refactoring","tag-rust","tag-syntax"],"_links":{"self":[{"href":"https:\/\/blogs.oregonstate.edu\/clangdo\/wp-json\/wp\/v2\/posts\/41","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.oregonstate.edu\/clangdo\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.oregonstate.edu\/clangdo\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.oregonstate.edu\/clangdo\/wp-json\/wp\/v2\/users\/12972"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.oregonstate.edu\/clangdo\/wp-json\/wp\/v2\/comments?post=41"}],"version-history":[{"count":3,"href":"https:\/\/blogs.oregonstate.edu\/clangdo\/wp-json\/wp\/v2\/posts\/41\/revisions"}],"predecessor-version":[{"id":51,"href":"https:\/\/blogs.oregonstate.edu\/clangdo\/wp-json\/wp\/v2\/posts\/41\/revisions\/51"}],"wp:attachment":[{"href":"https:\/\/blogs.oregonstate.edu\/clangdo\/wp-json\/wp\/v2\/media?parent=41"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.oregonstate.edu\/clangdo\/wp-json\/wp\/v2\/categories?post=41"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.oregonstate.edu\/clangdo\/wp-json\/wp\/v2\/tags?post=41"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}fn create_seed() -> Image {\n let texture_extent = Extent3d {\n width: TEXTURE_SIZE.x,\n height: TEXTURE_SIZE.y,\n depth_or_array_layers: 1\n };\n\n let mut data = Vec::new();\n let channels = 2;\n let size = channels * TEXTURE_SIZE.x * TEXTURE_SIZE.y;\n \n for _ in 0..size {\n data.push(fastrand::u8(0..=0xff));\n }\n\n \/\/ We only need two channels for the seed.\n Image::new(\n texture_extent,\n TextureDimension::D2,\n data,\n TextureFormat::Rg8Unorm,\n )\n}<\/code><\/pre>\n\n\n\n\n\/\/ These are the x start and end pairs for the grid rectangles\nlet x_bounds = square_x_starts\n .into_iter()\n .zip(square_x_ends.into_iter());\n\n\/\/ These are the y start and end pairs for the grid rectangles\nlet y_bounds: Vec<(f64, f64)> = square_y_starts\n .into_iter()\n .zip(square_y_ends.into_iter())\n .collect();\n<\/pre><\/div>\n\n\n