Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Kazakovtsev Vladimdr task-3 #72

Open
wants to merge 1 commit into
base: task-3
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 9 additions & 0 deletions .idea/IFMO_JAVA_Basics_20182009.iml

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

36 changes: 27 additions & 9 deletions src/main/java/ru/ifmo/cet/javabasics/WarAndPeaceExercise.java
Original file line number Diff line number Diff line change
Expand Up @@ -2,20 +2,38 @@

import java.nio.file.Path;
import java.nio.file.Paths;

import java.nio.file.Files;
import java.io.IOException;
import java.nio.charset.Charset;
import java.util.*;
import java.util.stream.Collectors;
import java.util.stream.Stream;

public class WarAndPeaceExercise {

public static String warAndPeace() {
public static String warAndPeace() throws IOException{
final Path tome12Path = Paths.get("src", "main", "resources", "WAP12.txt");
final Path tome34Path = Paths.get("src", "main", "resources", "WAP34.txt");
final Charset charset = Charset.forName("windows-1251");
List<String> strings = Files.readAllLines(tome12Path, charset);
strings.addAll(Files.readAllLines(tome34Path, charset));
Map<String, Integer> dictionary = new TreeMap<String, Integer>();

// TODO map lowercased words to its amount in text and concatenate its entries.
// TODO Iff word "котик" occurred in text 23 times then its entry would be "котик - 23\n".
// TODO Entries in final String should be also sorted by amount and then in alphabetical order iff needed.
// TODO Also omit any word with lengths less than 4 and frequency less than 10

throw new UnsupportedOperationException();
String text = strings.toString().replaceAll("[^a-zA-Zа-яА-Я]", " ").toLowerCase();
Stream<String> reading = Stream.of(text.split(" "));
reading.filter((word) -> word.length() >= 4).forEach((word) -> {
dictionary.merge(word, 1, (oldWal, newWal) -> oldWal+newWal);
});
List<Map.Entry<String, Integer>> forSorting =
new LinkedList(dictionary.entrySet());
forSorting.sort(Map.Entry.comparingByKey());
forSorting.sort(Map.Entry.<String, Integer>comparingByValue().reversed());
StringBuffer result = new StringBuffer();
forSorting.stream().filter(counter -> counter.getValue()>=10)
.forEach(counter ->{
result.append(counter.getKey()+" - "+counter.getValue()+"\n");
});
return result.toString().substring(0, result.length()-1);
//throw new UnsupportedOperationException();
}

}