Erinevus lehekülje "ITI0011RUS:task 05" redaktsioonide vahel
|  (→Шаблон) | |||
| (ei näidata 2 kasutaja 5 vahepealset redaktsiooni) | |||
| 6. rida: | 6. rida: | ||
| === Описание === | === Описание === | ||
| − | + | Прочитать текст из файла [[Meedia:Garbage Collector Article.txt|Garbage Collector Article]].   | |
| − | + | Реализовать требуемые в шаблоне функции. | |
| − | + | В качестве разделителя используйте символ пробела. | |
| − | |||
| === Шаблон === | === Шаблон === | ||
| 18. rida: | 17. rida: | ||
| import java.util.HashMap; | import java.util.HashMap; | ||
| import java.util.HashSet; | import java.util.HashSet; | ||
| − | |||
| − | |||
| − | |||
| public class CollectionTask { | public class CollectionTask { | ||
| 46. rida: | 42. rida: | ||
| 	 *         a list of words otherwise. | 	 *         a list of words otherwise. | ||
| 	 */ | 	 */ | ||
| − | 	public static  | + | 	public static ArrayList<String> getWords(String text) { | 
| 		// TODO Enter your code here | 		// TODO Enter your code here | ||
| 61. rida: | 57. rida: | ||
| 	 *         a set of unique words otherwise. | 	 *         a set of unique words otherwise. | ||
| 	 */ | 	 */ | ||
| − | 	public static  | + | 	public static HashSet<String> getUniqueWords(String text) { | 
| 		// TODO Enter your code here | 		// TODO Enter your code here | ||
| 80. rida: | 76. rida: | ||
| 	 *               a map of words otherwise.   | 	 *               a map of words otherwise.   | ||
| 	 */ | 	 */ | ||
| − | 	public static  | + | 	public static HashMap<String, Integer> getWordCount(String text) { | 
| 		// TODO Enter your code here | 		// TODO Enter your code here | ||
Viimane redaktsioon: 2. märts 2015, kell 19:21
Срок сдачи упражнения 9-е занятие (4-е марта).
Общая информация об упражнениях: ITI0011RUS_Practice.
Обратно на страницу предмета.
Описание
Прочитать текст из файла Garbage Collector Article.
Реализовать требуемые в шаблоне функции. В качестве разделителя используйте символ пробела.
Шаблон
<source lang="java"> import java.util.ArrayList; import java.util.HashMap; import java.util.HashSet;
public class CollectionTask {
/** * The function should read the contents of the file * designated by the filename and return its contents * as a string. * @param filename - A file name to read. * @return null if file is inaccessible (cannot be read or does not exist), * a string containing file contents otherwise. */ public static String readFile(String filename) { String text = "";
return text; }
/** * The function returns a list containing * all the words from the input string. * @param text - an input string. * @return null, if the string is not supplied, * an empty list, if the string contains no words, * a list of words otherwise. */ public static ArrayList<String> getWords(String text) {
// TODO Enter your code here
return null; }
/** * The function returns the set containing only * unique words from the input string. * @param text - an input string * @return null, if the string is not supplied, * an empty set, if the string contains no words, * a set of unique words otherwise. */ public static HashSet<String> getUniqueWords(String text) {
// TODO Enter your code here
return null; }
	/**
	 * The function counts how many times each word
	 * can be found in the text and saves this 
	 * information in the Map object, where the key is 
	 * the word, and the value is the amount of times 
	 * the considered word can be found in the text.
	 * @param text - an input string
	 * @return null, if the string is not supplied,
	 *               an empty set, if the string contains no words,
	 *               a map of words otherwise. 
	 */
	public static HashMap<String, Integer> getWordCount(String text) {
// TODO Enter your code here
return null; }
/** * The main function should print out * the result of the getWordCount() method. * @param args - input parameters. */ public static void main(String[] args) { // TODO Enter your code here }
} </source>