ITI0011RUS:task 05 - Redigeerimiste ajalugu

Aleksandr: /* Описание */

2015-03-02T19:21:10Z

Описание

Ago – 26. veebruar 2015, kell 07:45

2015-02-26T07:45:35Z

Aleksandr: /* Описание */

2015-02-24T23:35:27Z

Описание

Aleksandr: /* Описание */

2015-02-24T23:33:42Z

Описание

Aleksandr: /* Описание */

2015-02-24T23:33:16Z

Описание

Aleksandr: /* Описание */

2015-02-24T23:31:17Z

Описание

Aleksandr: /* Шаблон */

2015-02-24T23:26:45Z

Шаблон

Aleksandr: /* Шаблон */

2015-02-24T23:24:35Z

Шаблон

Aleksandr: /* Шаблон */

2015-02-24T22:41:23Z

Шаблон

Aleksandr: /* Описание */

2015-02-24T22:34:13Z

Описание

←Vanem redaktsioon		Redaktsioon: 2. märts 2015, kell 19:21
9. rida:		9. rida:

	Реализовать требуемые в шаблоне функции.		Реализовать требуемые в шаблоне функции.
		+	В качестве разделителя используйте символ пробела.

	=== Шаблон ===		=== Шаблон ===

@@ 16. rida: / 16. rida: @@
 import java.util.HashMap;
 import java.util.HashSet;
 public class CollectionTask {
@@ 44. rida: / 41. rida: @@
 	 *         a list of words otherwise.
 	 */
-	public static List<String> getWords(String text) {
+	public static ArrayList<String> getWords(String text) {
 		// TODO Enter your code here
@@ 59. rida: / 56. rida: @@
 	 *         a set of unique words otherwise.
 	 */
-	public static Set<String> getUniqueWords(String text) {
+	public static HashSet<String> getUniqueWords(String text) {
 		// TODO Enter your code here
@@ 78. rida: / 75. rida: @@
 	 *               a map of words otherwise.
 	 */
-	public static Map<String,Integer> getWordCount(String text) {
+	public static HashMap<String, Integer> getWordCount(String text) {
 		// TODO Enter your code here

@@ 6. rida: / 6. rida: @@
 === Описание ===
-. Прочитать текст из файла [[Meedia:Garbage Collector Article.txt]]. Занести в ArrayList все слова.
+Прочитать текст из файла [[Meedia:Garbage Collector Article.txt|Garbage Collector Article]].
-. Из полученного списка слов выбрать уникальные (ArrayList -> Set).
+Реализовать требуемые в шаблоне функции.
 === Шаблон ===

@@ 6. rida: / 6. rida: @@
 === Описание ===
-. Прочитать текст из файла [[Garbage Collector Article.txt]]. Занести в ArrayList все слова.
+. Прочитать текст из файла [[Meedia:Garbage Collector Article.txt]]. Занести в ArrayList все слова.
 . Из полученного списка слов выбрать уникальные (ArrayList -> Set).

@@ 6. rida: / 6. rida: @@
 === Описание ===
-. Прочитать текст из файла [[Garbage Collector Article]]. Занести в ArrayList все слова.
+. Прочитать текст из файла [[Garbage Collector Article.txt]]. Занести в ArrayList все слова.
 . Из полученного списка слов выбрать уникальные (ArrayList -> Set).

@@ 47. rida: / 47. rida: @@
 	 */
 	public static List<String> getWords(String text) {
 		// TODO Enter your code here
-		return words;
+		return null;
+	}
@@ 63. rida: / 62. rida: @@
 	 */
 	public static Set<String> getUniqueWords(String text) {
 		// TODO Enter your code here
-		return unique_words;
+		return null;
+	}
@@ 83. rida: / 81. rida: @@
 	 */
 	public static Map<String,Integer> getWordCount(String text) {
 		// TODO Enter your code here
-		return wordCount;
+		return null;
+	}

@@ 15. rida: / 15. rida: @@
 <source lang="java">
 public class CollectionTask {
-	public static String text = "Garbage Collection in Java\r\n" +
+	/**
-			"\r\n" +
+	 * The function should read the contents of the file
-			"This is the first in a series of posts about Garbage Collection (GC). " +
+	 * designated by the filename and return its contents
-"I hope to be able to cover a bit of theory and all the major collectors in the hotspot virtual machine over the course of the series. This post just explains what garbage collection is and elements common to different collectors.\r\n" +
+	 * as a string.
-			"\r\n" +
+	 * @param filename - A file name to read.
-			"Why should I care?\r\n" +
+	 * @return null if file is inaccessible (cannot be read or does not exist),
-			"\r\n" +
+	 *         a string containing file contents otherwise.
-			"Your Java virtual machine manages memory for you – which is highly convenient – but it might not be optimally tuned by default. By understanding some of the theory behind garbage collection you can more easily tune your collector. A common concern is collector efficiency, that is to say how much time your program spends executing program code rather than collecting garbage. Another common concern is long that application pauses for.\r\n" +
+	 */
-			"\r\n" +
+	public static String readFile(String filename) {
-			"There’s also a lot of hearsay and folklore out there about garbage collection and so understanding the algorithms in a bit more detail really helps avoid falling into common pitfalls and traps. Besides – for anyone interested in how computer science principles are applied and used, JVM internals are a great thing to look at.\r\n" +
+		String text = "";
-			"\r\n" +
-			"What does stop-the-world mean?\r\n" +
+		return text;
-			"\r\n" +
-			"Your program (or mutator in GC-Speak) will be allocating objects as it runs. At some point your heap needs to be collected and all of the collectors in hotspot pause your application. The term ‘stop-the-world’ is used to mean that all of the mutator’s threads are paused.\r\n" +
-			"\r\n" +
+	/**
-			"Its possible to implement a garbage collector that doesn’t need to pause. Azul have implemented an effectively pauseless collector in their Zing virtual machine. I won’t be covering how it works but there’s a really interesting whitepaper if you want to know more.\r\n" +
+	 * The function returns a list containing
-			"\r\n" +
+	 * all the words from the input string.
-			"The Young/Weak Generational Hypothesis\r\n" +
+	 * @param text - an input string.
-			"\r\n" +
+	 * @return null, if the string is not supplied,
-			"Simply stated: Most allocated objects die young 1. This concept was demonstrated by empirically analysing the memory allocation and liveness patterns of a large group of programs during the 1980s. What researchers found was that not only do most objects die young but once they live past a certain age they tend to live for a long time. The graph below is taken from a SUN/Oracle study looking at the lifespan of objects as a histogram.\r\n" +
+	 *         an empty list, if the string contains no words,
-			"\r\n" +
+	 *         a list of words otherwise.
-			"190245\r\n" +
+	 */
-			"\r\n" +
+	public static List<String> getWords(String text) {
-			"How is Heap organised?\r\n" +
+		List<String> words = new ArrayList<String>();
-			"\r\n" +
-			"The young generational hypothesis has given rise to the idea of generational garbage collection in which heap is split up into several regions, and the placement of objects within each region corresponds to their age. One element that is common to the above these garbage collectors (other than G1) is the way that heap is organised into different spaces.\r\n" +
+		// TODO Enter your code here
-			"\r\n" +
-			"java-memory\r\n" +
+		return words;
-			"\r\n" +
+	}
+	/**
+}
 </source>

@@ 7. rida: / 7. rida: @@
 . Прочитать текст из переменной text. Занести в ArrayList все слова.
 . Из полученного списка слов выбрать уникальные (ArrayList -> Set).
 . Для каждого слова посчитать сколько раз оно встречается. (ArrayList -> Map).