compareto

everybody. I have completed my code two txt files by showing on the same area. but I want to compare two txt files line by line. and I want to show the differences with Colored lines and finally, The letter or words that are different, different line I'm going to bold. how can i start? thanks for now, my code is here. JTextArea might make a suitable view, but you still need to model the differences. I'd look at the Eclipse or NetBeans platforms, or perhaps svnview . Rock You might need to ask user to upload both versions of file. In the server you need to compare line by line, and store the

I've been trying to figure out how the CompareTo() method works internally and I failed. I've searched this site and read some posts, and I think I've seen all there is to see in MSDN about this subject and I just don't seem to get it. An MSDN example: public int CompareTo(object obj) { if (obj == null) { return 1; } Temperature otherTemperature = obj as Temperature; if (otherTemperature != null) { return this.temperatureC.CompareTo(otherTemperature.temperatureC); } else { throw new ArgumentException("the object is not a temperature"); } } This is the MSDN example of the implementation of the

Ok, I'm sure that this must exist on here somewhere, but I can't seem to find it. Is there, and if there is what is, a minimum (non-null) String sequence according to String#CompareTo ? I'm guessing "" but I'm not entirely sure. Given the implementation of String#compareTo (see source ) you can verify that a string of size 0 (thus the empty string) will always be inferior or equal to any other non null string. (equal in case of comparing to the empty string). Edit: Try this, String s=""; String s1=new String(new char[-2]); // Here you will get NagativeArraySize Exception System.out.println(s1

I am writing a phonebook program in java and i need to list people in the list alphabetically and to do that i need to write a sorting algorithm for a list in java and it should use only compareTo() method. So can anyone help me to do that? public void listAlpha() { Node tempNode = head; for(int i = 0; i <= size; i++) { for(int j = 0; j <= i; j++) { int comparison = ((tempNode.getNext().getElement().getName()).compareTo(tempNode.getElement().getName())); if(comparison < 0) { Person tempPerson = tempNode.getElement(); tempNode.setElement(tempNode.getNext().getElement()); tempNode.getNext()

Suppose I want to sort a list of Employee objects: Employee emp1 = new Employee("Abhijit", 10); Employee emp2 = new Employee("Aniket", 5); Employee emp3 = new Employee("Chirag", 15); List<Employee> employees = new ArrayList<Employee>(); employees.add(emp1); employees.add(emp2); employees.add(emp3); Collections.sort(employees); System.out.println("sorted List is: "+employees); And my Employee class implements Comparable , therefore it must override the compareTo() method. And I have to write my sorting logic in the compareTo() method. class Employee implements Comparable<Employee> { String name

I have created a Student class like this: public class Student implements Comparable<Student> { private String firstName; private String lastName; public Student(String firstName, String lastName) { this.firstName = firstName; this.lastName = lastName; } // Getters & Setters follow here... @Override public int compareTo(Student student) { int hash = this.firstName.compareTo(student.firstName); return hash; } @Override public String toString() { return "Student [firstName=" + firstName + ", lastName=" + lastName + "]"; } } This is my test class where I just add elements to my TreeSet: public