Home > Articles > Programming > General Programming/Other Languages

Containers in Ruby

  • Print
  • + Share This
This chapter is from the book

This chapter is from the book

Arrays

An array, or list, is very much like a string in some ways: It is a container whose elements can be referred to by their position and whose elements can be examined and changed using the same techniques you have just learned. But there is a big difference between the two. An array can hold objects of any type, not just characters.

Instead of the quotation marks that you use to create a string, surround a new array with square brackets. Elements of an array are separated by commas.

 veggies = ["corn", "carrots"]
 small_primes = [2, 3, 5, 7, 11]
 some_objects = ["a string", 44, self]

How would you find the second element of the veggies array? Knowing what you know about string objects, you should be able to guess. (Remember, we start counting from zero.)

 veggies[1]    #–> "carrots"
 veggies[1] = "lettuce" # veggies == ["corn", "lettuce"]

Arrays grow as needed, just as strings do. New storage slots are created on demand, with nils inserted when necessary.

 veggies[2] = "peas" # veggies == ["corn", "lettuce", "peas"] 
 veggies[8] = "squash"
 # veggies == ["corn", "lettuce", "peas", nil, nil, nil, nil, nil, "squash"]

We've seen that for strings, the [index,length] notation specifies substrings; for arrays, it specifies subarrays.

 n = [39, 38, 12, 6, 5]
 n[2,3]  #–> [12, 6, 5]
 n[–2,1] #–> [6]

You can replace subarrays in much the same way you learned with substrings. The lengths of the new and old subarrays don't have to match, so subarrays can be deleted by replacing them with nothing (that is, nil), and they can be inserted by "replacing" a subarray whose length is zero.

 n[2,2] = [100, 101]
 # n == [39, 38, 100, 101, 5]
 n[1,1] = [200, 201, 202]
 # n == [39, 200, 201, 202, 100, 101, 5]
 n[4,2] = nil
 # n == [39, 200, 201, 202, 5]
 n[2,0] = ["two strings", "inserted"] 
 # n == [39, 200, "two strings", "inserted", 201, 202, 5]

When defining an array of strings that contain no spaces, you will find that the following syntax sugar saves wear on your fingers and keyboard. The w stands for words.

 %w(black gray green white blue orange)
 # ["black", "gray", "green", "white", "blue", "orange"]

Arrays understand the << and + methods just as strings do. In fact, if you go through the string methods and try each of them on arrays, you'll find that all the ones that make sense for arrays will do what you expect them to, while those with specific meanings that apply only to strings are rejected.

 a1 = [10, 20, 30] #–> [10, 20, 30]
 a2 = %w(a b)  #–> ["a", "b"]
 a2 << "c"   #–> ["a", "b", "c"]
 a3 = a2 + a1  #–> ["a", "b", "c", 10, 20, 30]
 a3.include? ("b") #–> true
 a1.include? ("b") #–> false
 a3.index (20)  #–> 4
 a3.capitalize  # error

Arrays Containing Arrays

If an array can hold any kind of object, there's no reason it can't hold another array.

 pocket = ["wallet", ["house key", "garage key"], "watch"]

The second element of pocket is a collection of keys, presumably on a key ring. How would you refer to the first key in that collection? If it isn't clear at first, assign a name to the key ring.

 key_ring = pocket[1] #–> ["house key", "garage key"]
 key_ring[0]   #–> "house key"

That's clear, but a little wordy. Unless we expect to refer to the key ring repeatedly in the future, there is no need to give it a special name now. Since they refer to the same thing, you should be able to substitute pocket[1] for key_ring. It might feel safer to parenthesize when doing this sort of thing, but in this case it's not necessary.

 (pocket[1])[0] #–> "house key"
 pocket[1][0] #–> "house key"

Hardly anyone uses the parentheses for multiple indices, but you can use them, or else just visualize them, if you ever get confused about the order in which to write them. For instance, a square matrix can be expressed as an array of arrays, where each "inner" array corresponds to a row:

 # The matrix we want:
 # 11 12 13
 # 14 15 16
 # 17 18 19
 
 m = [ [11,12,13], [14,15,16], [17,18,19] ]

Suppose you want the item in the last column and first row. Which do you say: m[0][2] or m[2][0]? If you remember that the inner arrays are rows, then you know that m[0] is the first row, and so (m[0])[2] is what you want.

 m[0][2] #–> 13

It so happens that Ruby is supplied with a powerful Matrix class. Later in the book we'll also be defining our own matrix class, which will be somewhat simpler than Ruby's.

You can flatten an array if you want to ungroup the arrays within it. This can put all of m's matrix elements in a straight line, and it can take your keys off their ring so that they jangle around loose in your pocket.

 m.flatten
 #–> [11, 12, 13, 14, 15, 16, 17, 18, 19]
 pocket.flatten
 #–> ["wallet", "house key", "garage key", "watch"]

We'll list some other useful array methods in a moment.

FIFOs and Stacks

FIFO stands for first in, first out. Conceptually, a FIFO is a one-way pipe: Objects go in one end and come out the other, always in the same order they went in. Ruby offers four methods for implementing variable-length FIFOs, which are push, pop, shift, and unshift; but you need only two of them. push and shift will suffice.

 pipe = [] # empty array; same as Array.new
 # "push" objects in to the right end ...
 pipe.push("one") # pipe == ["one"]
 pipe.push("two") # pipe == ["one","two"]
 pipe.push("three") # pipe == ["one","two","three"]
 # ... then "shift" them out from the left end.
 x = pipe.shift  #–> "one"
 y = pipe.shift  #–> "two"
 z = pipe.shift  #–> "three"

Instead of using push and shift, we could use unshift and pop. The array would be organized backward, but in the end the values found in x, y, and z would be the same.

Why such odd names for these method pairs? Because they're not really pairs. push and pop go together, and were designed for implementing stacks. shift and unshift were designed for dealing with command-line arguments. We will leave the command line aside for now, but we mustn't neglect stacks.

Stacks

Consider a top-loading cafeteria plate dispenser, equipped with a spring so that a single plate is always accessible at the top. The order in which plates are dispensed is exactly the opposite of what you observe in a FIFO. The plate you take off the top had to be the last one put in, often fresh from the dishwasher (ever notice how warm it is?), and conversely, the first plate lowered into the dispenser cannot be taken out until all the ones above it are gone. This is last in, first out behavior.

We don't need a fresh example to illustrate a stack. If you modify the FIFO example in the preceding section by replacing each shift with a pop, then you'll have a stack. At the end you'll find x=="three", y=="two", and z=="one".

A Few Useful Array Instance Methods

min, max

Return the smallest or largest element, respectively.

 [3,5,2,4].min #–> 2
 %w(Underhill Zamboni James).max #–> "Zamboni"

uniq

Return a copy with only unique elements.

 [1,2,2,3,3,3,4,4,4,4,5,5,5,5,5].uniq #–> [1, 2, 3, 4, 5]

compact

Return a copy with all nil elements removed.

 a = Array.new #–> []
 a[6] = "r" # a == [nil, nil, nil, nil, nil, nil, "r"]
 a.compact  #–> ["r"]

sort

Return a sorted copy. Later we'll learn how to specify custom sorts.

 %w(Underhill Zamboni James).sort
 #–> ["James", "Underhill", "Zamboni"]

&, |

Perform intersections and unions for sets.

 s1 = [1,2,3,4,5,7,9]
 s2 = [2,4,5,6,7,8,9]
 s1 & s2 #–> [2, 4, 5, 7, 9]
 s1 | s2 #–> [1, 2, 3, 4, 5, 6, 7, 8, 9]

grep(/description/)

We'll wait until Day 8 to see the full power of this method (and to explain why the description is surrounded by slashes instead of quotes), but for now we can at least make it show us array elements that contain a specific substring.

%w(knee ankle foot leg knuckle toe elbow).grep (/le/)
 #–> ["ankle", "leg", "knuckle"]
  • + Share This
  • 🔖 Save To Your Account

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020