public final int compareTo(Object object) { final RankedWordProposal word= (RankedWordProposal)object; final int rank= word.getRank(); if (fRank < rank) return -1; if (fRank > rank) return 1; return 0; }
public final boolean equals(Object object) { if (object instanceof RankedWordProposal) return object.hashCode() == hashCode(); return false; }
if (sentence) buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance)); buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance));
if (sentence) buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance)); return; buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); matches.add(new RankedWordProposal(buffer.toString(), -distance)); minimum= distance;
if (sentence) buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance)); buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance));
@Override public final int compareTo(RankedWordProposal word) { final int rank= word.getRank(); if (fRank < rank) return -1; if (fRank > rank) return 1; return 0; }
@Override public final boolean equals(Object object) { if (object instanceof RankedWordProposal) return object.hashCode() == hashCode(); return false; }
if (sentence) buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance)); buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance));
@Override public final int compareTo(RankedWordProposal word) { final int rank= word.getRank(); if (fRank < rank) return -1; if (fRank > rank) return 1; return 0; }
@Override public final boolean equals(Object object) { if (object instanceof RankedWordProposal) return object.hashCode() == hashCode(); return false; }
if (sentence) buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); result.add(new RankedWordProposal(buffer.toString(), -distance)); return; buffer.setCharAt(0, Character.toUpperCase(buffer.charAt(0))); matches.add(new RankedWordProposal(buffer.toString(), -distance)); minimum= distance;