initial commit

src/SonnetI.txt

@@ -0,0 +1,14 @@
+From fairest creatures we desire increase,
+That thereby beauty's rose might never die,
+But as the riper should by time decease,
+His tender heir might bear his memory:
+But thou contracted to thine own bright eyes,
+Feed'st thy light's flame with self-substantial fuel,
+Making a famine where abundance lies,
+Thy self thy foe, to thy sweet self too cruel:
+Thou that art now the world's fresh ornament,
+And only herald to the gaudy spring,
+Within thine own bud buriest thy content,
+And, tender churl, mak'st waste in niggarding:
+Pity the world, or else this glutton be,
+To eat the world's due, by the grave and thee.

src/lesson2/Lesson2.java

@@ -0,0 +1,140 @@
+/**
+ * Copyright © 2014, Oracle and/or its affiliates. All rights reserved.
+ *
+ * JDK 8 MOOC Lesson 2 homework
+ */
+package lesson2;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.nio.charset.StandardCharsets;
+import java.nio.file.Files;
+import java.nio.file.Paths;
+import java.util.Arrays;
+import java.util.List;
+
+/**
+ * @author Speakjava ([email protected])
+ */
+public class Lesson2 {
+  private static final String WORD_REGEXP = "[- .:,]+";
+
+  /**
+   * Run the exercises to ensure we got the right answers
+   *
+   * @throws java.io.IOException
+   */
+  public void runExercises() throws IOException {
+    System.out.println("JDK 8 Lambdas and Streams MOOC Lesson 2");
+    System.out.println("Running exercise 1 solution...");
+    exercise1();
+    System.out.println("Running exercise 2 solution...");
+    exercise2();
+    System.out.println("Running exercise 3 solution...");
+    exercise3();
+    System.out.println("Running exercise 4 solution...");
+    exercise4();
+    System.out.println("Running exercise 5 solution...");
+    exercise5();
+    System.out.println("Running exercise 6 solution...");
+    exercise6();
+    System.out.println("Running exercise 7 solution...");
+    exercise7();
+  }
+
+  /**
+   * Exercise 1
+   *
+   * Create a new list with all the strings from original list converted to 
+   * lower case and print them out.
+   */
+  private void exercise1() {
+    List<String> list = Arrays.asList(
+        "The", "Quick", "BROWN", "Fox", "Jumped", "Over", "The", "LAZY", "DOG");
+
+    /* YOUR CODE HERE */
+  }
+
+  /**
+   * Exercise 2
+   *
+   * Modify exercise 1 so that the new list only contains strings that have an
+   * odd length
+   */
+  private void exercise2() {
+    List<String> list = Arrays.asList(
+        "The", "Quick", "BROWN", "Fox", "Jumped", "Over", "The", "LAZY", "DOG");
+
+    /* YOUR CODE HERE */
+  }
+
+  /**
+   * Exercise 3
+   *
+   * Join the second, third and forth strings of the list into a single string,
+   * where each word is separated by a hyphen (-). Print the resulting string.
+   */
+  private void exercise3() {
+    List<String> list = Arrays.asList(
+        "The", "quick", "brown", "fox", "jumped", "over", "the", "lazy", "dog");
+
+    /* YOUR CODE HERE */
+  }
+
+  /**
+   * Count the number of lines in the file using the BufferedReader provided
+   */
+  private void exercise4() throws IOException {
+    try (BufferedReader reader = Files.newBufferedReader(
+        Paths.get("SonnetI.txt"), StandardCharsets.UTF_8)) {
+      /* YOUR CODE HERE */
+    }
+  }
+
+  /**
+   * Using the BufferedReader to access the file, create a list of words with
+   * no duplicates contained in the file.  Print the words.
+   * 
+   * HINT: A regular expression, WORD_REGEXP, is already defined for your use.
+   */
+  private void exercise5() throws IOException {
+    try (BufferedReader reader = Files.newBufferedReader(
+        Paths.get("SonnetI.txt"), StandardCharsets.UTF_8)) {
+      /* YOUR CODE HERE */
+    }
+  }
+
+  /**
+   * Using the BufferedReader to access the file create a list of words from 
+   * the file, converted to lower-case and with duplicates removed, which is
+   * sorted by natural order.  Print the contents of the list.
+   */
+  private void exercise6() throws IOException {
+    try (BufferedReader reader = Files.newBufferedReader(
+        Paths.get("SonnetI.txt"), StandardCharsets.UTF_8)) {
+      /* YOUR CODE HERE */
+    }
+  }
+
+  /**
+   * Modify exercise6 so that the words are sorted by length
+   */
+  private void exercise7() throws IOException {
+    try (BufferedReader reader = Files.newBufferedReader(
+        Paths.get("SonnetI.txt"), StandardCharsets.UTF_8)) {
+      /* YOUR CODE HERE */
+    }
+  }
+
+  /**
+   * Main entry point for application
+   *
+   * @param args the command line arguments
+   * @throws IOException If file access does not work
+   */
+  public static void main(String[] args) throws IOException {
+    Lesson2 lesson = new Lesson2();
+    lesson.runExercises();
+  }
+}
+

src/lesson2/SolutionsLesson2.java

@@ -0,0 +1,179 @@
+/**
+ * Copyright © 2014, Oracle and/or its affiliates. All rights reserved.
+ *
+ * JDK 8 MOOC Lesson 2 homework
+ */
+package lesson2;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.nio.charset.StandardCharsets;
+import java.nio.file.Files;
+import java.nio.file.Paths;
+import java.util.Arrays;
+import java.util.List;
+import java.util.stream.Collectors;
+import java.util.stream.Stream;
+
+/**
+ * @author Speakjava ([email protected])
+ */
+public class SolutionsLesson2 {
+  private static final String WORD_REGEXP = "[- .:,]+";
+
+  /**
+   * Run the exercises to ensure we got the right answers
+   *
+   * @throws java.io.IOException
+   */
+  public void runExercises() throws IOException {
+    System.out.println("JDK 8 Lambdas and Streams MOOC Lesson 2");
+    System.out.println("Running exercise 1 solution...");
+    exercise1();
+    System.out.println("Running exercise 2 solution...");
+    exercise2();
+    System.out.println("Running exercise 3 solution...");
+    exercise3();
+    System.out.println("Running exercise 4 solution...");
+    exercise4();
+    System.out.println("Running exercise 5 solution...");
+    exercise5();
+    System.out.println("Running exercise 6 solution...");
+    exercise6();
+    System.out.println("Running exercise 7 solution...");
+    exercise7();
+  }
+
+  /**
+   * Exercise 1
+   *
+   * Create a new list with all the strings from original list converted to
+   * lower case and print them out.
+   */
+  private void exercise1() {
+    List<String> list = Arrays.asList(
+        "The", "Quick", "BROWN", "Fox", "Jumped", "Over", "The", "LAZY", "DOG");
+
+    List<String> newList = list.stream()
+        .map(String::toLowerCase)
+        .collect(Collectors.toList());
+
+    newList.forEach(System.out::println);
+  }
+
+  /**
+   * Exercise 2
+   *
+   * Modify exercise 1 so that the new list only contains strings that have an
+   * odd length
+   */
+  private void exercise2() {
+    List<String> list = Arrays.asList(
+        "The", "Quick", "BROWN", "Fox", "Jumped", "Over", "The", "LAZY", "DOG");
+
+    List<String> newList = list.stream()
+        .filter(w -> w.length() % 2 == 1)
+        .map(String::toLowerCase)
+        .collect(Collectors.toList());
+
+    newList.forEach(System.out::println);
+  }
+
+  /**
+   * Exercise 3
+   *
+   * Join the second, third and forth strings of the list into a single string,
+   * where each word is separated by a hyphen (-). Print the resulting string.
+   */
+  private void exercise3() {
+    List<String> list = Arrays.asList(
+        "The", "quick", "brown", "fox", "jumped", "over", "the", "lazy", "dog");
+
+    String merged = list.stream()
+        .skip(1)
+        .limit(3)
+        .collect(Collectors.joining("-"));
+    System.out.println(merged);
+  }
+
+  /**
+   * Count the number of lines in the file using the BufferedReader provided
+   */
+  private void exercise4() throws IOException {
+    try (BufferedReader reader = 
+        Files.newBufferedReader(Paths.get("SonnetI.txt"))) {
+      long lineCount = reader.lines().count();
+      System.out.println("Number of lines = " + lineCount);
+    }
+  }
+
+  /**
+   * Using the BufferedReader to access the file, create a list of words with no
+   * duplicates contained in the file. Print the words.
+   *
+   * HINT: A regular expression, WORD_REGEXP, is already defined for your use.
+   */
+  private void exercise5() throws IOException {
+    try (BufferedReader reader = 
+        Files.newBufferedReader(Paths.get("SonnetI.txt"))) {
+
+      List<String> uniqueWords = reader.lines()
+          .flatMap(line -> Stream.of(line.split(WORD_REGEXP)))
+          .distinct()
+          .collect(Collectors.toList());
+
+      uniqueWords.stream()
+          .forEach(System.out::println);
+    }
+  }
+
+  /**
+   * Using the BufferedReader to access the file create a list of words from the
+   * file, converted to lower-case and with duplicates removed, which is sorted
+   * by natural order. Print the contents of the list.
+   */
+  private void exercise6() throws IOException {
+    try (BufferedReader reader = 
+        Files.newBufferedReader(Paths.get("SonnetI.txt"))) {
+
+      List<String> words = reader.lines()
+          .flatMap(line -> Stream.of(line.split(WORD_REGEXP)))
+          .map(String::toLowerCase)
+          .distinct()
+          .sorted()
+          .collect(Collectors.toList());
+
+      words.stream().forEach(System.out::println);
+    }
+  }
+
+  /**
+   * Modify exercise6 so that the words are sorted by length
+   */
+  private void exercise7() throws IOException {
+    try (BufferedReader reader = 
+        Files.newBufferedReader(Paths.get("SonnetI.txt"))) {
+
+      List<String> words = reader.lines()
+          .flatMap(line -> Stream.of(line.split(WORD_REGEXP)))
+          .map(String::toLowerCase)
+          .distinct()
+          .sorted((a, b) -> a.length() - b.length())
+          .collect(Collectors.toList());
+
+      words.stream().forEach(System.out::println);
+    }
+  }
+
+  /**
+   * Main entry point for application
+   *
+   * @param args the command line arguments
+   * @throws IOException If file access does not work
+   */
+  public static void main(String[] args) throws IOException {
+    SolutionsLesson2 lesson = new SolutionsLesson2();
+    lesson.runExercises();
+  }
+}
+