/****************************************************************************

**

** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).

** All rights reserved.

** Contact: Nokia Corporation (qt-info@nokia.com)

**

** This file is part of the tools applications of the Qt Toolkit.

**

** $QT_BEGIN_LICENSE:LGPL$

** No Commercial Usage

** This file contains pre-release code and may not be distributed.

** You may use this file in accordance with the terms and conditions

** contained in the Technology Preview License Agreement accompanying

** this package.

**

** GNU Lesser General Public License Usage

** Alternatively, this file may be used under the terms of the GNU Lesser

** General Public License version 2.1 as published by the Free Software

** Foundation and appearing in the file LICENSE.LGPL included in the

** packaging of this file.  Please review the following information to

** ensure the GNU Lesser General Public License version 2.1 requirements

** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.

**

** In addition, as a special exception, Nokia gives you certain additional

** rights.  These rights are described in the Nokia Qt LGPL Exception

** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.

**

** If you have questions regarding the use of this file, please contact

** Nokia at qt-info@nokia.com.

**

**

**

**

**

**

**

**

** $QT_END_LICENSE$

**

****************************************************************************/

/*

  editdistance.cpp

*/

#include "editdistance.h"

QT_BEGIN_NAMESPACE

int editDistance( const QString& s, const QString& t )

{

#define D( i, j ) d[(i) * n + (j)]

    int i;

    int j;

    int m = s.length() + 1;

    int n = t.length() + 1;

    int *d = new int[m * n];

    int result;

    for ( i = 0; i < m; i++ )

	D( i, 0 ) = i;

    for ( j = 0; j < n; j++ )

	D( 0, j ) = j;

    for ( i = 1; i < m; i++ ) {

	for ( j = 1; j < n; j++ ) {

	    if ( s[i - 1] == t[j - 1] ) {

		D( i, j ) = D( i - 1, j - 1 );

	    } else {

		int x = D( i - 1, j );

		int y = D( i - 1, j - 1 );

		int z = D( i, j - 1 );

		D( i, j ) = 1 + qMin( qMin(x, y), z );

	    }

	}

    }

    result = D( m - 1, n - 1 );

    delete[] d;

    return result;

#undef D

}

QString nearestName( const QString& actual, const QSet<QString>& candidates )

{

    int deltaBest = 10000;

    int numBest = 0;

    QString best;

    QSet<QString>::ConstIterator c = candidates.begin();

    while ( c != candidates.end() ) {

	if ( (*c)[0] == actual[0] ) {

	    int delta = editDistance( actual, *c );

	    if ( delta < deltaBest ) {

		deltaBest = delta;

		numBest = 1;

		best = *c;

	    } else if ( delta == deltaBest ) {

		numBest++;

	    }

	}

	++c;

    }

    if ( numBest == 1 && deltaBest <= 2 &&

	 actual.length() + best.length() >= 5 ) {

	return best;

    } else {

	return "";

    }

}

QT_END_NAMESPACE