Book Image

Polished Ruby Programming

By : Jeremy Evans
5 (1)
Book Image

Polished Ruby Programming

5 (1)
By: Jeremy Evans

Overview of this book

Anyone striving to become an expert Ruby programmer needs to be able to write maintainable applications. Polished Ruby Programming will help you get better at designing scalable and robust Ruby programs, so that no matter how big the codebase grows, maintaining it will be a breeze. This book takes you on a journey through implementation approaches for many common programming situations, the trade-offs inherent in each approach, and why you may choose to use different approaches in different situations. You'll start by refreshing Ruby fundamentals, such as correctly using core classes, class and method design, variable usage, error handling, and code formatting. Then you'll move on to higher-level programming principles, such as library design, use of metaprogramming and domain-specific languages, and refactoring. Finally, you'll learn principles specific to web application development, such as how to choose a database and web framework, and how to use advanced security features. By the end of this Ruby programming book, you’ll be a well rounded web developer with a deep understanding of Ruby. While most code examples and principles discussed in the book apply to all Ruby versions, some examples and principles are specific to Ruby 3.0, the latest release at the time of publication.
Table of Contents (23 chapters)
Section 1: Fundamental Ruby Programming Principles
Section 2: Ruby Library Programming Principles
Section 3: Ruby Web Programming Principles

Learning when to use custom data structures

Ruby only offers two main core data structures for collections, arrays, and hashes. However, Ruby arrays and hashes are not simple arrays or hash tables; they are complex internally. Ruby takes care of most of the performance issues when dealing with arrays and hashes. For example, when adding an element to an array when the array does not have any room internally, Ruby expands the array not by a single element, but in relation to how large the array currently is, so that if you keep adding elements to the array, it doesn't need to resize the array each time. Likewise, for small hash tables, Ruby may store the hash table as a simple list if it thinks it will be faster to scan the list than use a real hash table. If the hash table grows, Ruby will internally convert the list into a real hash table, at the point at which it roughly determines that it will be faster to use a separate hash lookup.

In a lower-level language such as C,...