armandino.myopenid.com

[Java] On clean up nested loops?

2008-01-19T04:33:14-08:00

I haven't tested this properly but I think it should work.

## java

    public Collection findAllDuplicates(List<NameAddress> list, int threshold) {
        Collection<NameAddress> duplicates = new HashSet<NameAddress>();
        boolean[] isDuplicate = new boolean[list.size()];
        
        for(int i = 0; i < list.size(); i++) {
            for(int k = i+1; k < list.size() && !isDuplicate[i]; k++) {
                if(!isDuplicate[k] && rateSimilarity(list.get(i), list.get(k)) >= threshold) {
                    duplicates.add(list.get(k));
                    isDuplicate[k] = true;
                }
            }
        }
        
        return duplicates;
    }

[Ruby] On script for subversion status manipulation

2007-12-18T07:06:15-08:00

That's a handy script Philippe!

I used to do batch operations using xargs but this is a lot simpler and cleaner. Good idea! :)

## 'svn add' all new files [shell-unix-generic]

svn st | grep ? | sed -e 's/?//g' | xargs svn add

[Python] On Custom sort a list of words

2007-12-12T03:00:47-08:00

Hi Jared,

There seems to be a problem with the last two return statements. I'm not that familiar with python syntax to fix it tho :)

An unrelated question.. what's the benefit of using alphabet.index(...) instead of the find method? The latter, I understand, doesn't throw an error.

[Python] Custom sort a list of words

2007-12-10T02:36:13-08:00

My second python script. :)

This one sorts a list of words in a particular order, which depends on the order of characters in the 'alphabet' string.

Any suggestions on how to improve / simplify it?


def sort(words):

    sortedList = []

    for i in range(len(words)):

        word = words[i]

        if not sortedList:

            sortedList.append(word)

        else:

            for j in range(len(sortedList)):

                sortedWord = sortedList[j]

                if isLeftWordBeforeRight(word, sortedWord):

                    sortedList.insert(j, word)

                    break

                elif j == (len(sortedList) - 1):

                    sortedList.append(word)

    return sortedList





def isLeftWordBeforeRight(left, right):

    isBefore = False

    if right.startswith(left):

        isBefore = True

    else:

        for n in range(len(left)):

            if n < len(right):

                comparison = compareChars(left[n], right[n])

                if comparison != 0:

                    isBefore = comparison < 0

                    break    

    return isBefore



def compareChars(left, right):

    return  alphabet.find(left) - alphabet.find(right)





alphabet = "zyxwvutsrqpomnlkjihgfedcba"



inputWords = ["england", "france", "spain", "italy", "greece", "portugal",

              "canada", "usa", "mexico", "peru", "cuba", "chile", "argentina",

              "zimbabwe", "uganda", "congo", "zambia", "namibia", "ghana"]



print sort(inputWords)

[Java] On Equals Method

2007-12-08T07:13:06-08:00

I usually implement equals methods along these lines...

public boolean equals(Object obj)
{
    boolean isEqual = false;

    if(obj != null && obj instanceof Bus)
    {
        Bus bus = (Bus)obj;

        isEqual = bus.getType().equals(getType())
               && bus.getMaxRange() == getMaxRange());
    }

    return isEqual;
}

[Python] Count word occurrences in a string

2007-12-08T07:03:40-08:00

This code counts number of occurrences of each word in a string.

How can I improve it or make it more pythonic?

import re

def addWord(token, frequencies):
    count = 0
    word = ''.join(token)
    if word in frequencies:
        count = frequencies[word]
    frequencies[word] = count + 1

def getWordFrequencies(text):
    pattern = re.compile('\w')
    frequencies = {}
    token = []
    
    for c in text:
        if pattern.search(c):
            token.append(c)
        elif token:
            addWord(token, frequencies)
            token = []
    
    if token:
        addWord(token, frequencies)

    return frequencies



mamaMia = \
"Mamma mia, here I go again\
Mamma mia, here I go again\
My my, how can I resist you?\
Mamma mia, does it show again?\
My my, just how much I've missed you"

result = getWordFrequencies(mamaMia)

for word, freq in result.iteritems():
    print freq, "\t", word