Held: Monday, 11 November 2013

Back to Outline 37 - Pause for Breath: Sorting. On to Outline 39 - Priority Queues and their Basic Implementation.

Summary

We explore anonymous inner classes, a powerful Java programming technique.

Related Pages

• Reading: Anonymous Inner Classes
• Lab: Anonymous Inner Classes
• Code: https://github.com/Grinnell-CSC207/anonymous-inner-classes
• EBoard (Source) (HTML) (PDF)

Overview

• Detour: An invariant for merge.
• Anonymous inner classes.

Administrivia

• I will reserve time for questions on HW9.
• We will spend some of today's class looking at the invariant for merge sort. (We will stop at 10:25 to give you time for lab.)
• Upcoming extra credit opportunities:
  • Town Hall, Wednesday, November 13, noon or 7:30 p.m.
  • Learning from Alumni, Thursday, 2:15: Atul Gupta, Trustee
  • CS Extra, Thursday: Hilary Mason '00
  • Evening chat with Hilary Mason '00, 8-9 pm
  • CS Table, Next Friday, HCI
  • Innovation Class, Friday, 12:45, ARH 302, Hilary Mason '00
  • CDO with Hilary Mason '00, Friday, 4:15-6:30 (???)
  • Swim meet, Saturday, noon
  • Digital Commons talk Monday, November 19, 7:00 p.m. or so
  • "Data Sovereignty: The Challenge of Geolocating Data in the Cloud", November 25, 4:15 JRC 101
  • "Gold Fever" by Andrew Sherburne '01 or so, 7:00 p.m., Monday, November 25, ARH 302
  • Tuesday, November 20, 4:15 p.m., JRC 209 a gaming event with the game [d0x3d!]

Detour: Invariants for Merge

Anonymous Inner Classes

• Almost as cool as anonymous functions.

Basic structure

new *Interface*() {
    *Body of Class*
}

Uses' * On-the-fly predicates * On-the-fly comparators * Iterators * And more

Lab