Skip to content
Snippets Groups Projects
Commit 51f38dde authored by BAUER Oscar's avatar BAUER Oscar
Browse files

started tp 11 but tp10 not finished

parent 4b072838
No related branches found
No related tags found
No related merge requests found
package tp10.exo2;
import java.util.Comparator;
import java.util.Map;
import java.util.Map.Entry;
public class ComparatorMapEntry implements Comparator<Map.Entry<String, Integer>> {
@Override
public int compare(Entry<String, Integer> o1, Entry<String, Integer> o2) {
// TODO Auto-generated method stub
if (o1.getValue() > o2.getValue())
return -1;
if (o1.getValue() < o2.getValue())
return 1;
return new StringComparator().compare(o1.getKey(), o2.getKey());
}
}
package tp10.exo2;
import java.util.Comparator;
public class StringComparator implements Comparator<String> {
@Override
public int compare(String o1, String o2) {
// TODO Auto-generated method stub
return o1.compareTo(o2) > 0 ? 1 : o1.compareTo(o2);
}
}
...@@ -10,13 +10,14 @@ public class TestDisplayWordOccurrences { ...@@ -10,13 +10,14 @@ public class TestDisplayWordOccurrences {
man.addWord("test2"); man.addWord("test2");
man.addWord("test3"); man.addWord("test3");
man.addWord("test4"); man.addWord("test4");
man.addWord("btest2"); man.addWord("test2");
man.addWord("test2"); man.addWord("test2");
man.addWord("test3"); man.addWord("test3");
man.addWord("test4"); man.addWord("test4");
man.displayWordOccurrences(); man.displayWordOccurrences();
man.displayUniqueWordsByAlphabet(); man.displayUniqueWordsByAlphabet();
man.displayWordOccurrencesByAlphabet();
} }
......
package tp10.exo2;
import java.util.HashSet;
public class TestDisplayWordOccurrencesByAlphabet {
public static void main(String[] args) {
WordsManager man = new WordsManager(new HashSet<String>());
man.addWord("test1");
man.addWord("test2");
man.addWord("test3");
man.addWord("test4");
man.addWord("test2");
man.addWord("test2");
man.addWord("test3");
man.addWord("test4");
man.displayWordOccurrencesByAlphabet();
man.displayWordOccurrencesByAlphabet();
}
}
...@@ -5,6 +5,7 @@ import java.util.Collections; ...@@ -5,6 +5,7 @@ import java.util.Collections;
import java.util.HashMap; import java.util.HashMap;
import java.util.HashSet; import java.util.HashSet;
import java.util.List; import java.util.List;
import java.util.Map;
public class WordsManager { public class WordsManager {
...@@ -38,6 +39,32 @@ public class WordsManager { ...@@ -38,6 +39,32 @@ public class WordsManager {
} }
void displayWordOccurrencesByAlphabet() { void displayWordOccurrencesByAlphabet() {
List<String> list = new ArrayList<>(this.uniqueWords);
String[] list2 = new String[list.size()];
int pos = 0;
for (String word : list) {
for (int idx = 0; idx < list.size(); idx++) {
if(list.indexOf(word) == idx) {
pos += word.compareTo(list.get(idx));
}
}
}
System.out.println(list);
System.out.println("pos: "+pos);
// Collections.sort(list);
//
// for (String word : list) {
// System.out.println(word + " : " + wordOccurrences.get(word));
// }
}
void displayWordOccurrencesByCount() {
List<Map.Entry<String, Integer>> list = new ArrayList<Map.Entry<String, Integer>>();
StringComparator comp = new StringComparator();
for (int idx = 0; idx < list.size(); idx++) {
}
} }
} }
package tp10.exo2;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
public class fiddling {
public static void main(String[] args) {
String test = "halloa";
String test2 = "hallob";
String test3 = "hallolc";
String test4 = "hallold";
List<String> list = new ArrayList<String>();
list.add(test);
list.add(test4);
list.add(test2);
list.add(test4);
list.add(test3);
Collections.sort(list, new StringComparator());
int bool = test.compareTo(test2);
System.out.println(list);
}
}
package tp11.exo1;
public class Message {
}
package tp11.exo1;
import java.util.ArrayList;
import java.util.List;
import java.util.Set;
public class User {
private String name;
private List<String> messages;
private Set<User> followers;
public User(String name) {
this.name = name;
this.messages = new ArrayList<String>();
this.followers = new
}
}
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment