building java programs
play

Building Java Programs Chapter 11 Sets and Maps reading: 11.2 - - PowerPoint PPT Presentation

Building Java Programs Chapter 11 Sets and Maps reading: 11.2 - 11.3 2 Sets (11.2) set : A collection of unique values (no duplicates allowed) that can perform the following operations efficiently: add, remove, search (contains) We


  1. Building Java Programs Chapter 11 Sets and Maps reading: 11.2 - 11.3

  2. 2

  3. Sets (11.2)  set : A collection of unique values (no duplicates allowed) that can perform the following operations efficiently:  add, remove, search (contains)  We don't think of a set as having indexes; we just add things to the set in general and don't worry about order "the" "of" "if" "to" set.contains("to") true "down" "from" "by" "she" "you" set.contains("be") false "in" "him" "why" set 3

  4. Maps (11.3)  map : Holds a set of key-value pairs, where each key is unique a.k.a. "dictionary", "associative array", "hash" key value "at" 43 map.get("the") key value key value "in" 37 "you" 22 key value key value "why" 14 "me" 31 56 key value "the" 56 set 4

  5. Map methods put( key , value ) adds a mapping from the given key to the given value; if the key already exists, replaces its value with the given one get( key ) returns the value mapped to the given key ( null if not found) containsKey( key ) returns true if the map contains a mapping for the given key remove( key ) removes any existing mapping for the given key removes all key/value pairs from the map clear() returns the number of key/value pairs in the map size() returns true if the map's size is 0 isEmpty() returns a string such as "{a=90, d=60, c=70}" toString() returns a set of all keys in the map keySet() returns a collection of all values in the map values() putAll( map ) adds all key/value pairs from the given map to this map equals( map ) returns true if given map has the same mappings as this one 5

  6. Evil Hangman (animation) {ally, beta, cool, deal, else, flew, good, hope, ibex} Guess: ‘e’ Pattern: “- - - -” “- - - -” “- - - -” “- - - -” “- e - -” “- e - -” “- - e -” “- - e -” “e - - e” “- - - e” {flew, ibex} {flew} {else} {hope} {ally, cool, good} {ally, cool} {ally} {beta, deal} {beta} {ally, cool, good} Guess: ‘o’ Pattern: “- - - -” “- - - -” “- o o -” {cool, good} {ally} {cool, good} Pattern: “- o o -” Guess: ‘d’ “- o o -” “- o o d” {cool} {good} 6

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend